Circuit and bond polytopes on series-parallel graphs
From MaRDI portal
Publication:1751117
DOI10.1016/j.disopt.2015.04.001zbMath1387.90208OpenAlexW2275037495MaRDI QIDQ1751117
Mathieu Lacroix, Roland Grappe, Pierre Pesneau, Pierre Fouilhoux, Sylvie Borne
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2015.04.001
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- On cardinality constrained cycle and path polytopes
- On the stable set polytope of a series-parallel graph
- Parallel recognition of series-parallel graphs
- Disjunctive programming: Properties of the convex hull of feasible points
- On the linear description of the 3-cycle polytope
- Topology of series-parallel networks
- \(k\)-edge connected polyhedra on series-parallel graphs
- On the Linear Description of the k-cycle Polytope
- Polyhedral Characterization of Discrete Dynamic Programming
- The traveling salesman problem on a graph and some related integer polyhedra
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- The Planar Hamiltonian Circuit Problem is NP-Complete
- The Graph Partitioning Polytope on Series-Parallel and 4-Wheel Free Graphs
- The Circuit Polytope: Facets
- Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
- The Matching Polytope has Exponential Extension Complexity
- The Steiner Traveling Salesman Polytope and Related Polyhedra
- When the cut condition is enough
- On cycle cones and polyhedra
- Extended formulations in combinatorial optimization
- A branch and cut approach to the cardinality constrained circuit problem.
This page was built for publication: Circuit and bond polytopes on series-parallel graphs
