Pages that link to "Item:Q1373745"

The following pages link to On strongly polynomial dual simplex algorithms for the maximum flow problem (Q1373745):

Displaying 10 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)
• Polynomial dual network simplex algorithms (Q689130) (← 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)
• 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)
• Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934) (← 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)