A SOLVABLE CASE OF THE TRAVELING SALESMAN PROBLEM

DOI10.1073/pnas.51.2.178zbMath0116.25001OpenAlexW2035873292WikidataQ34398242 ScholiaQ34398242MaRDI QIDQ5725691

Paul C. Gilmore, Ralph E. Gomory

Publication date: 1964

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.51.2.178

zbMATH Keywords

combinatorics

Related Items

On the symmetric travelling salesman problem I: Inequalities, Minimax 2-connected subgraphs and the bottleneck traveling salesman problem, The optimum assignments and a new heuristic approach for the traveling salesman problem