Master polytopes for cycles of binary matroids
From MaRDI portal
Publication:1824625
DOI10.1016/0024-3795(89)90478-3zbMath0683.05014MaRDI QIDQ1824625
Martin Grötschel, Klaus Truemper
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)90478-3
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
05B35: Combinatorial aspects of matroids and geometric lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The max-cut problem on graphs not contractible to \(K_ 5\)
- On the cycle polytope of a binary matroid
- Decomposition and optimization over cycles in binary matroids
- Decomposition of regular matroids
- Matroids and multicommodity flows
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Matching, Euler tours and the Chinese postman