Pages that link to "Item:Q3978616"

The following pages link to Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem (Q3978616):

Displaying 12 items.

• Polynomial dual network simplex algorithms (Q689130) (← links)
• Use of dynamic trees in a network simplex algorithm for the maximum flow problem (Q1176566) (← links)
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
• Random walks, totally unimodular matrices, and a randomised dual simplex algorithm (Q1330890) (← links)
• A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741) (← links)
• A new pivot selection rule for the network simplex algorithm (Q1373743) (← links)
• Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
• A network simplex algorithm for solving the minimum distribution cost problem (Q2379832) (← links)
• Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
• Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility (Q3035117) (← links)
• Mathematical Considerations on the Relationship between the Ordering of players and Winning Probability in Certain Types of Team Sports (Q3478272) (← links)
• (Q4845364) (← links)