Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices

DOI10.1137/0130021zbMath0346.90065OpenAlexW2103026976MaRDI QIDQ4116282

No author found.

Publication date: 1976

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0130021

Mathematics Subject Classification ID

Integer programming (90C10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items

Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope ⋮ Ideal polytopes and face structures of some combinatorial optimization problems ⋮ All 0-1 polytopes are traveling salesman polytopes ⋮ Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search ⋮ A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups ⋮ Adjacency of the 0-1 knapsack problem ⋮ Adjacency on polymatroids ⋮ Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors ⋮ On pedigree polytopes and Hamiltonian cycles ⋮ The adjacency relation on the traveling salesman polytope is NP-Complete ⋮ The skeleton of the symmetric Traveling Salesman Polytope ⋮ Pairs of Adjacent Hamiltonian Circuits with Small Intersection ⋮ Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions ⋮ Adjacency of the best and second best valued solutions in combinatorial optimization problems ⋮ Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph