Polyhedral Theory for Arc Routing Problems
- 1 January 2000
- book chapter
- Published by Springer Nature
- p. 199-230
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedraEuropean Journal of Operational Research, 1998
- The Capacitated Arc Routing Problem: Valid Inequalities and FacetsComputational Optimization and Applications, 1998
- Arc Routing Problems, Part I: The Chinese Postman ProblemOperations Research, 1995
- A polyhedral approach to the rural postman problemEuropean Journal of Operational Research, 1994
- Polyhedral study of the capacitated vehicle routing problemMathematical Programming, 1993
- Sequencing of Insertions in Printed Circuit Board AssemblyOperations Research, 1988
- An algorithm for the Rural Postman problem on a directed graph1986
- The traveling salesman problem on a graph and some related integer polyhedraMathematical Programming, 1985
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- The optimum traversal of a graphOmega, 1973