The Schrijver system of odd join polyhedra
From MaRDI portal
DOI10.1007/BF02122558zbMATH Open0642.90096OpenAlexW2101401322MaRDI QIDQ1101352FDOQ1101352
Authors: András Sebö 
Publication date: 1988
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02122558
Recommendations
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Polytopes and polyhedra (52Bxx)
Cites Work
- Title not available (Why is that?)
- Matching, Euler tours and the Chinese postman
- The ellipsoid method and its consequences in combinatorial optimization
- Covering directed and odd cuts
- The matroids with the max-flow min-cut property
- Linear Systems for Constrained Matching Problems
- On Odd Cuts and Plane Multicommodity Flows
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Cutting Planes
- On total dual integrality
- Brick decompositions and the matching rank of graphs
- 2-Matchings and 2-covers of hypergraphs
- On the structure of factorizable graphs
- A quick proof of Seymour's theorem on t-joins
- Total dual integrality implies local strong unimodularity
- Total dual integrality and b-matchings
- A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron
- Dual integrality in b-matching problems
- Finding thet-join structure of graphs
Cited In (8)
- On a min--max theorem on bipartite graphs
- On the feedback vertex set polytope of a series-parallel graph
- Minimum \(T\)-cuts and optimal \(T\)-pairings
- Trader multiflow and box-TDI systems in series-parallel graphs
- Undirected distances and the postman-structure of graphs
- The Schrijver system of the flow cone in series-parallel graphs
- Generalized edge packings
- On shortest \(T\)-joins and packing \(T\)-cuts
This page was built for publication: The Schrijver system of odd join polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101352)
