Pages that link to "Item:Q689130"

The following pages link to Polynomial dual network simplex algorithms (Q689130):

Displaying 9 items.

• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• Computational experience with exterior point algorithms for the transportation problem (Q702553) (← links)
• A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
• A new strongly polynomial dual network simplex algorithm (Q1373742) (← links)
• Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934) (← links)
• Flow constrained minimum cost flow problem (Q1937859) (← links)
• A new scaling algorithm for the minimum cost network flow problem (Q1970413) (← links)
• Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
• Probability Distributions on Partially Ordered Sets and Network Interdiction Games (Q5076709) (← links)