Pages that link to "Item:Q1761207"
From MaRDI portal
The following pages link to A faster polynomial algorithm for the constrained maximum flow problem (Q1761207):
Displaying 7 items.
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- A double scaling algorithm for the constrained maximum flow problem (Q941539) (← links)
- On the equivalence of constrained and unconstrained flows (Q1339398) (← links)
- A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310) (← links)
- A network simplex method for the budget-constrained minimum cost flow problem (Q1751898) (← links)
- (Q4875223) (← links)
- A strongly polynomial algorithm for generalized flow maximization (Q5259600) (← links)