DISOPT 2006 | Sciweavers

12

DISOPT
2006

118views more DISOPT 2006»

Improved bounds for vehicle routing solutions

13 years 4 months ago

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...

claim paper

Read More »

7

click to vote

DISOPT
2006

46views more DISOPT 2006»

Iterative patching and the asymmetric traveling salesman problem

13 years 4 months ago

Download dissertations.ub.rug.nl

Marcel Turkensteen, Diptesh Ghosh, Boris Goldengor...

claim paper

Read More »

8

click to vote

DISOPT
2006

48views more DISOPT 2006»

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs

13 years 4 months ago

Download eprints.pascal-network.org

Jørgen Bang-Jensen, Gregory Gutin, Anders Y...

claim paper

Read More »

9

click to vote

DISOPT
2006

90views more DISOPT 2006»

Tree decompositions of graphs: Saving memory in dynamic programming

13 years 4 months ago

Download theinf1.informatik.uni-jena.de

We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...

Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann

claim paper

Read More »

10

click to vote

DISOPT
2006

101views more DISOPT 2006»

Greedy-type resistance of combinatorial problems

13 years 4 months ago

Download wpweb2.tepper.cmu.edu

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

claim paper

Read More »

15

click to vote

DISOPT
2006

155views more DISOPT 2006»

Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms

13 years 4 months ago

Download pluto.mscc.huji.ac.il

We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...

Dorit S. Hochbaum, Asaf Levin

claim paper

Read More »

10

click to vote

DISOPT
2006

110views more DISOPT 2006»

New facets of the STS polytope generated from known facets of the ATS polytope

13 years 4 months ago

Download www.dei.unipd.it

While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on a...

Egon Balas, Robert Carr, Matteo Fischetti, Neil Si...

claim paper

Read More »

10

click to vote

DISOPT
2006

61views more DISOPT 2006»

The traveling salesman problem

13 years 4 months ago