On the Linear Description of the k-cycle Polytope

DOI10.1111/1475-3995.T01-1-00331MaRDI QIDQ3146124zbMATH OpenOpenAlexFDO

Authors Viet Hung Nguyen, Jean-François Maurras

Publication date 11 September 2002

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/1475-3995.t01-1-00331

zbMATH Keywords

polyhedral combinatoricsfacetlifting algorithm\(k\)-cycle

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• On the linear description of the 3-cycle polytope
• Facets for the cut cone. I
• Facets of the \(p\)-cycle polytope
• scientific article; zbMATH DE number 776078
• On the facets and diameter of thek-cycle polytope

Cited in

(13)

• Characterization of facets of the hop constrained chain polytope via dynamic programming
• On the linear description of the 3-cycle polytope
• scientific article; zbMATH DE number 776078 (Why is no real title available?)
• Circuit and bond polytopes on series-parallel graphs
• A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
• On the facets and diameter of thek-cycle polytope
• On cardinality constrained cycle and path polytopes
• Facets of the (s,t)-p-path polytope
• On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
• Facets of the \(k\)-partition polytope
• scientific article; zbMATH DE number 1517142 (Why is no real title available?)
• Facets of the \(p\)-cycle polytope
• A complete characterization of jump inequalities for the hop-constrained shortest path problem

This page was built for publication: On the Linear Description of the k-cycle Polytope

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