Pages that link to "Item:Q1380934"
From MaRDI portal
The following pages link to Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934):
Displaying 5 items.
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
- Equivalence of the primal and dual simplex algorithms for the maximum flow problem (Q1362513) (← links)
- Resource allocation decisions under various demands and cost requirements in an unreliable flow network (Q1781551) (← links)
- Maximum flow problem in wireless ad hoc networks with directional antennas (Q2458905) (← links)
- An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems (Q6087567) (← links)
