Computational experiments with algorithms for a class of routing problems
- 1 January 1983
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 10 (1) , 47-59
- https://doi.org/10.1016/0305-0548(83)90026-6
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxationsMathematical Programming, 1981
- Capacitated arc routing problemsNetworks, 1981
- Classification in vehicle routing and schedulingNetworks, 1981
- Combinatorial optimization and vehicle fleet planning: Perspectives and prospectsNetworks, 1981
- The Chinese Postman Problem for Mixed NetworksManagement Science, 1979
- Implementing vehicle routing algorithmsNetworks, 1977
- Networks and vehicle routing for municipal waste collectionNetworks, 1974
- The optimum traversal of a graphOmega, 1973
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973