On general routing problems

Networks

Volumn 6, Issue 3, 1976, Pages 273-280

  Lenstra, J K ^a   Kan, A H G Rinnooy ^b  

^a CWI   (Netherlands)

^b Graduate School of Management ^*  (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84981584138     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.3230060305     Document Type: Article

References (13)

1. Transformation of Multisalesmen Problem to the Standard Traveling Salesman Problem
2. Networks and Vehicle Routing for Municipal Waste Collection
3. A Note on Two Problems in Connexion with Graphs
4. The Chinese Postman's Problem
5. Matching, Euler Tours and the Chinese Postman
6. Reducibility Among Combinatorial Problems
7. On the Shortest Spanning Subtree of a Graph and the Traveling‐Salesman Problem
8. Some Simple Applications of the Travelling Salesman Problem
9. A Fundamental Problem in Vehicle Routing
10. Routing a Fleet of M Vehicles to/from a Central Facility
11. Shortest Connection Networks and Some Generalizations