Pages that link to "Item:Q1380934"

The following pages link to Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934):

Displaying 12 items.

• Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
• A polynomial-time simplex method for the maximum \(k\)-flow problem (Q688924) (← links)
• A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
• On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem (Q1180817) (← links)
• On the maximum capacity augmentation algorithm for the maximum flow problem (Q1314319) (← links)
• Equivalence of the primal and dual simplex algorithms for the maximum flow problem (Q1362513) (← links)
• A new strongly polynomial dual network simplex algorithm (Q1373742) (← links)
• On strongly polynomial dual simplex algorithms for the maximum flow problem (Q1373745) (← 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)
• A strongly polynomial algorithm for generalized flow maximization (Q5259600) (← links)
• An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems (Q6087567) (← links)