The st-bond polytope on series-parallel graphs
From MaRDI portal
Publication:4611490
DOI10.1051/RO/2018035zbMATH Open1405.90112OpenAlexW2801933314MaRDI QIDQ4611490FDOQ4611490
Authors: Roland Grappe, Mathieu Lacroix
Publication date: 18 January 2019
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2018035
Recommendations
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Maximal Flow Through a Network
- Title not available (Why is that?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The Planar Hamiltonian Circuit Problem is NP-Complete
- On the cut polytope
- Title not available (Why is that?)
- On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- On the dimension of projected polyhedra
- Topology of series-parallel networks
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Parallel recognition of series-parallel graphs
- The Concavity and Intersection Properties for Integral Polyhedra
- Lexicographical polytopes
- Circuit and bond polytopes on series-parallel graphs
- When the cut condition is enough, a complete characterization for multiflow problems in series-parallel networks
Cited In (4)
This page was built for publication: The \(st\)-bond polytope on series-parallel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4611490)