Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms
From MaRDI portal
Publication:1061620
zbMath0571.90089MaRDI QIDQ1061620
Publication date: 1983
Published in: Automation and Remote Control (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)
Related Items (5)
Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm ⋮ On the Skeleton of the Polytope of Pyramidal Tours ⋮ Some properties of the skeleton of the pyramidal tours polytope ⋮ Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search ⋮ Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
This page was built for publication: Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms
