Pages that link to "Item:Q2976148"
From MaRDI portal
The following pages link to A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148):
Displaying 14 items.
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
- On maximum flows in polyhedral domains (Q918212) (← links)
- A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310) (← links)
- A faster polynomial algorithm for the constrained maximum flow problem (Q1761207) (← links)
- A Polynomial Algorithm for Weighted Abstract Flow (Q3503842) (← links)
- (Q4875223) (← links)
- A simpler and faster strongly polynomial algorithm for generalized flow maximization (Q4977964) (← links)
- (Q5020876) (← links)
- A strongly polynomial algorithm for generalized flow maximization (Q5259600) (← links)
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q5415463) (← links)
- SOFSEM 2004: Theory and Practice of Computer Science (Q5902005) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
- Generalized maximum flow over time with intermediate storage (Q6546986) (← links)
- Minimizing convex functions with rational minimizers (Q6567265) (← links)