On Gilmore-Gomory's open question for the bottleneck TSP.
From MaRDI portal
Publication:1412716
DOI10.1016/S0167-6377(03)00050-6zbMath1052.90068MaRDI QIDQ1412716
Publication date: 25 November 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items
Multiobjective traveling salesperson problem on Halin graphs, Solution algorithms for synchronous flow shop problems with two dominating machines, The balanced traveling salesman problem, Complexity analysis of balloon drawing for rooted trees, A branch-and-cut algorithm for the balanced traveling salesman problem, Minimizing the number of workers in a paced mixed-model assembly line, Experimental analysis of heuristics for the bottleneck traveling salesman problem, An approximation algorithm for a bottleneck traveling salesman problem
Cites Work