Pages that link to "Item:Q2800362"
From MaRDI portal
The following pages link to The Cutting Plane Method is Polynomial for Perfect Matchings (Q2800362):
Displaying 6 items.
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Revisiting a cutting-plane method for perfect matchings (Q2165581) (← links)
- When the Gomory-chvátal closure coincides with the integer hull (Q2417111) (← links)
- A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming (Q2696937) (← links)
- Convergence proof for the GenCol algorithm in the case of two-marginal optimal transport (Q6622390) (← links)
