Modeling and solving several classes of arc routing problems as traveling salesman problems
- 1 November 1997
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 24 (11), 1057-1061
- https://doi.org/10.1016/s0305-0548(97)00013-0
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An optimal algorithm for the mixed Chinese postman problemNetworks, 1996
- Arc Routing Problems, Part II: The Rural Postman ProblemOperations Research, 1995
- Arc Routing Problems, Part I: The Chinese Postman ProblemOperations Research, 1995
- An algorithm for the Rural Postman problem on a directed graphPublished by Springer Nature ,1986
- Capacitated arc routing problemsNetworks, 1981
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman ProblemManagement Science, 1980
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman ProblemSIAM Journal on Computing, 1979
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973