Augment-insert algorithms for the capacitated arc routing problem
Author:
- Wen Lea PearnWPWen Lea Pearn
- 31 December 1991
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 18 (2) , 189-198
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Approximate solutions for the capacitated arc routing problemComputers & Operations Research, 1989
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable CasesAmerican Journal of Mathematical and Management Sciences, 1987
- Transforming arc routing into node routing problemsComputers & Operations Research, 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
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964