Efficiently solvable special cases of bottleneck travelling salesman problems
From MaRDI portal
Publication:1179263
DOI10.1016/0166-218X(91)90024-QzbMath0747.90081MaRDI QIDQ1179263
Rainer E. Burkard, W. Sandholzer
Publication date: 26 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
Related Items
Well-solved cases of the 2-peripatetic salesman problem, An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems, The Travelling Salesman Problem in symmetric circulant matrices with two stripes, A class of bottleneck expansion problems, Characterizing bipartite Toeplitz graphs, On \(t\)-diagnosability of multicore systems with symmetric circulant structure, On Hamiltonian paths in distance graphs, Pyramidal tours and multiple objectives, A comparison of lower bounds for the symmetric circulant traveling salesman problem, Long cycles and paths in distance graphs, Hamiltonian properties of Toeplitz graphs, An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices, Hamiltonian cycles in circulant digraphs with two stripes, Coloring planar Toeplitz graphs and the stable set polytope., The algebraic Monge property and path problems, On the recognition of permuted bottleneck Monge matrices, On the role of bottleneck Monge matrices in combinatorial optimization, Perspectives of Monge properties in optimization, Monge properties, discrete convexity and applications, Special cases of travelling salesman problems and heuristics, Coloring Toeplitz graphs
Cites Work
