A cutting plane procedure for the travelling salesman problem on road networks
- 1 September 1985
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 21 (3) , 307-317
- https://doi.org/10.1016/0377-2217(85)90151-1
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Distance conserving reductions for nonoriented networksOR Spectrum, 1983
- A branch and bound algorithm for the capacitated vehicle routing problemOR Spectrum, 1983
- A Cutting Planes Algorithm for the m-Salesmen ProblemJournal of the Operational Research Society, 1980
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- On the symmetric travelling salesman problem: A computational studyPublished by Springer Nature ,1980
- On the symmetric travelling salesman problem: Solution of a 120-city problemPublished by Springer Nature ,1980
- On the symmetric travelling salesman problem I: InequalitiesMathematical Programming, 1979
- Using cutting planes to solve the symmetric Travelling Salesman problemMathematical Programming, 1978
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954