On the linear description of the 3-cycle polytope

DOI10.1016/S0377-2217(01)00212-0zbMath1030.90133OpenAlexW2049132622MaRDI QIDQ1600839

Viet Hung Nguyen, Jean-Francois Maurras

Publication date: 16 June 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00212-0

zbMATH Keywords

liftingfacetpolyhedral combinatorics\(k\)-cycle

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Circuit and bond polytopes on series-parallel graphs ⋮ On cardinality constrained cycle and path polytopes ⋮ Facets of the \((s,t)-p\)-path polytope ⋮ On the facets and diameter of thek-cycle polytope

Uses Software

• cdd

Cites Work

• On the Linear Description of the k-cycle Polytope
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Faces for a linear inequality in 0–1 variables
• The Circuit Polytope: Facets
• Optimization of the flow through networks with gains
• A branch and cut approach to the cardinality constrained circuit problem.

This page was built for publication: On the linear description of the 3-cycle polytope