On the facets and diameter of thek-cycle polytope

DOI10.1080/02331930600711976MaRDI QIDQ3426327zbMATH OpenOpenAlexFDO

Authors

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

\(k\)-cycle polytopeadjacencydiameterfacetstravelling salesman polytope

Mathematics Subject Classification ID

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

Recommendations

• On the Linear Description of the k-cycle Polytope
• Faces of diameter two on the Hamiltonian cycle polytope
• Facets of the p-cycle polytope
• On the cycle polytope of a directed graph and its relaxations
• On the linear description of the 3-cycle polytope

Cites work

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

Cited in

(10)

• Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters
• On the linear description of the 3-cycle polytope
• Faces of diameter two on the Hamiltonian cycle polytope
• A combinatorial proof of the cyclic sieving phenomenon for faces of coxeterhedra
• On the Linear Description of the k-cycle Polytope
• The diameter of the ridge-graph of a cyclic polytope
• On the skeleton of the polytope of pyramidal tours
• A complete characterization of jump inequalities for the hop-constrained shortest path problem
• scientific article; zbMATH DE number 4187451 (Why is no real title available?)
• Characterization of facets of the hop constrained chain polytope via dynamic programming

Describes a project that uses

Uses Software

• PORTA

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

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