On Pedigree Polytopes and Hamiltonian Cycles

DOI10.1016/S1571-0653(04)00515-3zbMath1184.52015OpenAlexW2178022516MaRDI QIDQ3439015

Tim S. Arthanari

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00515-3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• An alternate formulation of the symmetric traveling salesman problem and its properties
• The adjacency relation on the traveling salesman polytope is NP-Complete
• Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
• Solution of a Large-Scale Traveling-Salesman Problem
• On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem
• Unnamed Item
• Unnamed Item

This page was built for publication: On Pedigree Polytopes and Hamiltonian Cycles