Adjacency of the Traveling Salesman Tours and 0 - 1 Vertices

DOI10.1137/0130021MaRDI QIDQ4116282zbMATH OpenOpenAlexFDO

Authors

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)

Cited in

(16)

• The skeleton of the symmetric Traveling Salesman Polytope
• Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
• Pairs of Adjacent Hamiltonian Circuits with Small Intersection
• A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups
• Adjacency of the best and second best valued solutions in combinatorial optimization problems
• Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors
• 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
• Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
• All 0-1 polytopes are traveling salesman polytopes
• The adjacency relation on the traveling salesman polytope is NP-Complete
• On pedigree polytopes and Hamiltonian cycles
• Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
• Adjacency on polymatroids
• Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
• Adjacency of the 0-1 knapsack problem

This page was built for publication: Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4116282)