Trader multiflow and box-TDI systems in series-parallel graphs
From MaRDI portal
Publication:2419363
DOI10.1016/j.disopt.2018.09.003zbMath1474.90374OpenAlexW2900875300WikidataQ128883653 ScholiaQ128883653MaRDI QIDQ2419363
Denis Cornaz, Roland Grappe, Mathieu Lacroix
Publication date: 13 June 2019
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2018.09.003
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Box-total dual integrality and edge-connectivity ⋮ Box-total dual integrality, box-integrality, and equimodular matrices ⋮ The Schrijver system of the flow cone in series-parallel graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizing conic TDI systems is hard
- The complexity of recognizing linear systems with certain integrality properties
- The box-TDI system associated with 2-edge connected spanning subgraphs
- The Schrijver system of odd join polyhedra
- Matroids and multicommodity flows
- The ellipsoid method and its consequences in combinatorial optimization
- The matroids with the max-flow min-cut property
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Max-multiflow/min-multicut for G+H series-parallel
- Topology of series-parallel networks
- A Characterization of Box-Mengerian Matroid Ports
- A Unified Approach to Box-Mengerian Hypergraphs
- On box totally dual integral polyhedra
- The Graph Partitioning Polytope on Series-Parallel and 4-Wheel Free Graphs
- On the cut polytope
- Matching, Euler tours and the Chinese postman
- When Is the Matching Polytope Box-Totally Dual Integral?
- Unifying maximum cut and minimum cut of a planar graph
This page was built for publication: Trader multiflow and box-TDI systems in series-parallel graphs
