Distance conserving reductions for nonoriented networks
From MaRDI portal
Publication:594774
DOI10.1007/BF01719842zbMath0526.90087MaRDI QIDQ594774
Publication date: 1983
Published in: OR Spektrum (Search for Journal in Brave)
Related Items
A new class of cutting planes for the symmetric travelling salesman problem, A note on computational aspects of the Steiner traveling salesman problem, A note on finding a shortest complete cycle in an undirected graph, A cutting plane procedure for the travelling salesman problem on road networks
Cites Work
- Unnamed Item
- Unnamed Item
- A Dynamic Programming Approach to Sequencing Problems
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
- Using cutting planes to solve the symmetric Travelling Salesman problem
- Distance matrix of a graph and its realizability
- Solution of a Large-Scale Traveling-Salesman Problem