Pages that link to "Item:Q4977964"
From MaRDI portal
The following pages link to A simpler and faster strongly polynomial algorithm for generalized flow maximization (Q4977964):
Displaying 11 items.
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← 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)
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence (Q2149565) (← links)
- A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
- A Polynomial Algorithm for Weighted Abstract Flow (Q3503842) (← links)
- (Q4875223) (← links)
- A strongly polynomial algorithm for generalized flow maximization (Q5259600) (← links)
- A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)
- SOFSEM 2004: Theory and Practice of Computer Science (Q5902005) (← links)
- Generalized maximum flow over time with intermediate storage (Q6546986) (← links)