Linear Systems for Constrained Matching Problems
From MaRDI portal
Recommendations
Cited in
(17)- The Schrijver system of odd join polyhedra
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus
- Structural properties of matroid matchings
- A polyhedral approach for a constrained matching problem
- A maximum b-matching problem arising from median location models with applications to the roommates problem
- The Schrijver system of the flow cone in series-parallel graphs
- An algorithmic approach to dual integrality of matching and extensions
- Constrained multi-object auctions and b-matching
- The minimum spanning k-core problem with bounded CVaR under probabilistic edge failures
- A network structural approach to the link prediction problem
- Total dual integrality implies local strong unimodularity
- Packing $k$-Matchings and $k$-Critical Graphs
- When is the matching polytope box-totally dual integral?
- Two-lattice polyhedra: Duality and extreme points
- Finding triangle-free 2-factors in general graphs
- The Schrijver system of the length polyhedron of an interval order
- A note on matchings and separability
This page was built for publication: Linear Systems for Constrained Matching Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3752421)