A polyhedral approach to the rural postman problem
- 24 November 1994
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 79 (1) , 95-114
- https://doi.org/10.1016/0377-2217(94)90398-0
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalitiesMathematical Programming, 1991
- A new class of cutting planes for the symmetric travelling salesman problemMathematical Programming, 1988
- Optimization of a 532-city symmetric traveling salesman problem by branch and cutOperations Research Letters, 1987
- The traveling salesman problem on a graph and some related integer polyhedraMathematical Programming, 1985
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- On the symmetric travelling salesman problem: Solution of a 120-city problemPublished by Springer Nature ,1980
- Approximation Algorithms for Some Postman ProblemsJournal of the ACM, 1979
- On general routing problemsNetworks, 1976
- A fundamental problem in vehicle routingNetworks, 1974
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973