The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Canonical greedy algorithms and dynamic programming”

Mathematical Optimization for the Train Timetabling Problem

Stanojević, Predrag, Marić, Miroslav, Kratica, Jozef, Bojović, Nebojša, Milenković, Miloš (2010)

Mathematica Balkanica New Series

Similarity:

AMS Subj. Classification: 90C57; 90C10; Rail transportation is very rich in terms of problems that can be modelled and solved using mathematical optimization techniques. The train scheduling problem as the most important part of a rail operating policy has a very significant impact on a rail company profit considering the fact that from the quality of a train timetable depends a flow of three most important resources on rail network: cars, locomotives and crews. The train timetabling...

A Variable Neighborhood Search Approach for Solving the Maximum Set Splitting Problem

Matic, Dragan (2012)

Serdica Journal of Computing

Similarity:

This paper presents a Variable neighbourhood search (VNS) approach for solving the Maximum Set Splitting Problem (MSSP). The algorithm forms a system of neighborhoods based on changing the component for an increasing number of elements. An efficient local search procedure swaps the components of pairs of elements and yields a relatively short running time. Numerical experiments are performed on the instances known in the literature: minimum hitting set and Steiner triple systems. Computational...

An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function

José Luis Quintero, Alejandro Crema (2005)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The multiparametric min max 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of min max 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to the objective function.