Master polytopes for cycles of binary matroids
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3133252 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3390827 (Why is no real title available?)
- Decomposition and optimization over cycles in binary matroids
- Decomposition of regular matroids
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Matching, Euler tours and the Chinese postman
- Matroids and multicommodity flows
- On the cycle polytope of a binary matroid
- The max-cut problem on graphs not contractible to \(K_ 5\)
Cited in
(9)- On a Generalization of the Master Cyclic Group Polyhedron
- On the cycle polytope of a binary matroid
- scientific article; zbMATH DE number 3990246 (Why is no real title available?)
- Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
- Decomposition and optimization over cycles in binary matroids
- Cycle algebras and polytopes of matroids
- Determining a matroid polytope by non-Radon partitions
- Cyclic flats of binary matroids
This page was built for publication: Master polytopes for cycles of binary matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1824625)