Pages that link to "Item:Q1072935"
From MaRDI portal
The following pages link to Computational experience with a polynomial-time dual simplex algorithm for the transportation problem (Q1072935):
Displaying 5 items.
- Computational experience with exterior point algorithms for the transportation problem (Q702553) (← links)
- Computational experience with a polynomial-time dual simplex algorithm for the transportation problem (Q1072935) (← links)
- Strongly polynomial simplex algorithm for bipartite vertex packing (Q1917242) (← links)
- A new scaling algorithm for the minimum cost network flow problem (Q1970413) (← links)
- Scaling: A general framework (Q3730337) (← links)