On cycle cones and polyhedra

DOI10.1016/0024-3795(89)90483-7zbMath0714.90071OpenAlexW2086498273MaRDI QIDQ5895283

William R. Pulleyblank, Collette R. Coullard

Publication date: 1989

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(89)90483-7

zbMATH Keywords

Halin graphspolynomial decomposition-based algorithmweighted girth problem

Mathematics Subject Classification ID

Convex programming (90C25) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Paths and cycles (05C38)

Related Items (8)

The Steiner cycle polytope ⋮ Cycle selections ⋮ Cycle algebras and polytopes of matroids ⋮ On the cut polyhedron. ⋮ On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms ⋮ Circuit and bond polytopes on series-parallel graphs ⋮ Facets of the \((s,t)-p\)-path polytope ⋮ Facets of the \(p\)-cycle polytope

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
• On the cone of nonnegative circuits
• Reductions to 1–matching polyhedra
• The traveling salesman problem in graphs with 3-edge cutsets
• On Linear Characterizations of Combinatorial Optimization Problems
• Halin graphs and the travelling salesman problem

This page was built for publication: On cycle cones and polyhedra