Pages that link to "Item:Q689130"
From MaRDI portal
The following pages link to Polynomial dual network simplex algorithms (Q689130):
Displayed 5 items.
- 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)
- A new scaling algorithm for the minimum cost network flow problem (Q1970413) (← links)