Routing a vehicle of capacity greater than one

Discrete Applied Mathematics

Volumn 81, Issue 1-3, 1998, Pages 41-57

  Guan, D J ^a  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Elevator problem; Feedback vertex set; Graph algorithms; Motion planning; NP complete; Satisfiability problem; Vehicle routing

Indexed keywords

EID: 0002580830     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00074-7     Document Type: Article

References (8)

1. M.J. Atallah, S.R. Kosaraju, Efficient solutions to some transportation problems with application to minimizing robot arm travel, SIAM J. Comput. 17 (5) (1988) 849-869.
2. G.N. Frederickson, M.S. Hecht, C.E. Kim, Approximation algorithms for some routing problems, SIAM J. Comput. 7 (2) (1978) 178-193.
3. G.N. Frederickson, A note on the complexity of a simple transportation problem, SIAM J. Comput. 22 (1) (1993) 57-61.
4. G.N. Frederickson, D.J. Guan, Preemptive ensemble motion planning on a tree, SIAM J. Comput. 21 (6) (1992) 1130-1152.
5. G.N. Frederickson, D.J. Guan, Nonpreemptive ensemble motion planning on a tree, Algorithms, 15 (1) (1993) 29-60.
6. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman and Company, New York, 1976.
7. D.B. Johnson, A priority queue in which initialization and queue operations take O(log log D) time, Math. System Theory 15 (1982) 295-309.
8. R.M. Karp, Two combinatorial problems associated with external sorting, in: R. Rustin (ed.), Combinatorial Algorithms, Courant Computer Science Symp., vol. 9, Algorithmics Press, New York, January 1972, pp. 17-29.