Algorithms for capacitated vehicle routing

SIAM Journal on Computing

Volumn 31, Issue 3, 2002, Pages 665-682

  Charikar, Moses ^a   Khuller, Samir ^a   Raghavachari, Balaji ^a  

^a Stanford University   (United States)

Author keywords

Approximation algorithms; Graphs; Traveling salesman problem; Vehicle routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; TRAVELING SALESMAN PROBLEM; VEHICLES;

VEHICLE ROUTING;

OPERATIONS RESEARCH;

EID: 0036305570     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701392056     Document Type: Article

References (20)

1. Approximation algorithms for the capacitated traveling salesman problem with pick-ups and deliveries
2. The swapping problem
3. Restricted delivery problems on a network
4. Polynomial time approximation schemes for Euclidean TSP and other geometric problem
5. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
6. Covering points in the plane by k-tours: Towards a polynomial time approximation scheme for general k
7. Efficient solutions to some transportation problems with applications to minimizing robot arm travel
8. Vehicle routing with backhauls: Models, algorithms and case studies
9. Algorithms for robot grasp and delivery
10. Vehicle routing
11. A note on the complexity of a simple transportation problem
12. Non-preemptive ensemble motion planning on a tree
13. Preemptive ensemble motion planning on a tree
14. Approximation algorithms for some routing problems
15. Bounds and heuristics for capacitated routing problems
16. Two combinatorial problems associated with external sorting
17. Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems