Distance conserving reductions for nonoriented networks
- 1 December 1983
- journal article
- research article
- Published by Springer Nature in OR Spectrum
- Vol. 5 (4) , 195-205
- https://doi.org/10.1007/bf01719842
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Computational comparison of two methods for finding the shortest complete cycle or circuit in a graphRairo-Operations Research, 1981
- On the symmetric travelling salesman problem: Solution of a 120-city problemPublished by Springer Nature ,1980
- Using cutting planes to solve the symmetric Travelling Salesman problemMathematical Programming, 1978
- Distance matrix of a graph and its realizabilityQuarterly of Applied Mathematics, 1965
- A Heuristic Approach to Solving Travelling Salesman ProblemsManagement Science, 1964