Sciweavers

9 search results - page 1 / 2
» disopt 2006
Sort
View
DISOPT
2006
61views more  DISOPT 2006»
13 years 4 months ago
The traveling salesman problem
Gregory Gutin, Abraham Punnen
DISOPT
2006
46views more  DISOPT 2006»
13 years 4 months ago
Iterative patching and the asymmetric traveling salesman problem
Marcel Turkensteen, Diptesh Ghosh, Boris Goldengor...
DISOPT
2006
101views more  DISOPT 2006»
13 years 4 months ago
Greedy-type resistance of combinatorial problems
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
Gareth Bendall, François Margot
DISOPT
2006
118views more  DISOPT 2006»
13 years 4 months ago
Improved bounds for vehicle routing solutions
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...
Agustín Bompadre, Moshe Dror, James B. Orli...