9 search results - page 1 / 2 » disopt 2006 |
83
Voted
DISOPT
2006
15 years 1 months ago
2006
76
Voted
DISOPT
2006
15 years 1 months ago
2006
73
Voted
DISOPT
2006
15 years 1 months ago
2006
107
Voted
DISOPT
2006
15 years 1 months ago
2006
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...
97
Voted
DISOPT
2006
15 years 1 months ago
2006
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...