Pages that link to "Item:Q1221561"
From MaRDI portal
The following pages link to Blocking pairs of polyhedra arising from network flows (Q1221561):
Displaying 8 items.
- A proof of Fulkerson's characterization of permutation matrices (Q1221117) (← links)
- Integer Rounding for Polymatroid and Branching Optimization Problems (Q3668310) (← links)
- On assignment functions (Q3729085) (← links)
- Dynamic decomposition method for linear programming problems with ceneralized upper bounds (Q3777793) (← links)
- Packing and covering with integral feasible flows in integral supply-demand networks (Q3790920) (← links)
- Transversal matroid intersections and related packings (Q4126086) (← links)
- Dominants and submissives of matching polyhedra (Q4726052) (← links)
- Integral decomposition in polyhedra (Q4740329) (← links)
