Approximate solutions for the capacitated arc routing problem
- 1 January 1989
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 16 (6) , 589-600
- https://doi.org/10.1016/0305-0548(89)90044-0
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable CasesAmerican Journal of Mathematical and Management Sciences, 1987
- A parallel insert method for the capacitated arc routing problemOperations Research Letters, 1984
- Computational experiments with algorithms for a class of routing problemsComputers & Operations Research, 1983
- Capacitated arc routing problemsNetworks, 1981
- Routing electric meter readersComputers & Operations Research, 1979
- The optimum traversal of a graphOmega, 1973
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973