A new variant of a vehicle routing problem: Lower and upper bounds

European Journal of Operational Research

Volumn 139, Issue 3, 2002, Pages 557-577

  Glaab, Holger ^a,b  

^a UNIVERSITY OF AUGSBURG   (Germany)

^b Münchener Rückversicherungs Gesellschaft ^*  (Germany)

Author keywords

Combinatorial optimization; Cutting; Heurstics; Travelling salesman; Vehicle routing

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CUTTING; HEURISTIC METHODS; LASER BEAMS; PROBLEM SOLVING;

VEHICLE ROUTING PROBLEMS;

TRAVELING SALESMAN PROBLEM;

EID: 0037118571     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00201-6     Document Type: Article

References (16)

1. The asymmetric travelling salesmen problem: A duality based branch-and-bound algorithm
2. Solving large-scale matching problems
3. Branch and bound methods
4. The Hamiltonian p-median problem
5. Data structures for weigthed matching and nearest common ancestors with linking
6. Rundreiseprobleme beim halbautomatischen Lederzuschnitt
7. The Hamiltonian p-median polytope
8. The nesting problem in the leather manufacturing industry
9. The traveling-salesman problem and minimal spanning trees