On the Relation Between the Traveling-Salesman and the Longest-Path Problems
From MaRDI portal
Publication:5328561
DOI10.1287/opre.10.5.647zbMath0124.36204OpenAlexW2119606130MaRDI QIDQ5328561
Nemhauser, George I., W. W. Hardgrave
Publication date: 1962
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.10.5.647
Related Items
Improving Christofides' lower bound for the traveling salesman problem, A travelling salesman problem (TSP) with multiple job facilities., The Steiner traveling salesman problem and its extensions, A new integer programming formulation of the graphical traveling salesman problem, On \({\mathbb{K}}^{\Delta}\), A note on finding a shortest complete cycle in an undirected graph, Compact formulations of the Steiner traveling salesman problem and related problems
