On the facets and diameter of thek-cycle polytope

DOI10.1080/02331930600711976zbMath1136.90047OpenAlexW2095103432MaRDI QIDQ3426327

No author found.

Publication date: 8 March 2007

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930600711976

zbMATH Keywords

diameterfacetsadjacencytravelling salesman polytope\(k\)-cycle polytope

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (3)

On the Skeleton of the Polytope of Pyramidal Tours ⋮ A complete characterization of jump inequalities for the hop-constrained shortest path problem ⋮ Characterization of facets of the hop constrained chain polytope via dynamic programming

Uses Software

• PORTA

Cites Work

• The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
• Faces with large diameter on the symmetric traveling salesman polytope
• On the linear description of the 3-cycle polytope
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope
• On the Linear Description of the k-cycle Polytope
• The traveling salesman problem on a graph and some related integer polyhedra
• The travelling salesman problem and a class of polyhedra of diameter two
• The adjacency relation on the traveling salesman polytope is NP-Complete
• The Circuit Polytope: Facets
• Facets of the \(p\)-cycle polytope

This page was built for publication: On the facets and diameter of thek-cycle polytope