Pages that link to "Item:Q3204329"
From MaRDI portal
The following pages link to POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS (Q3204329):
Displaying 9 items.
- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem (Q1003485) (← links)
- Computational experience with a polynomial-time dual simplex algorithm for the transportation problem (Q1072935) (← links)
- Exploiting special structure in a primal-dual path-following algorithm (Q1803615) (← links)
- A strongly polynomial algorithm for the transportation problem (Q1804365) (← links)
- Determination of optimal vertices from feasible solutions in unimodular linear programming (Q2366606) (← links)
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs (Q2811304) (← links)
- Extremal Points and an Algorithm for a Class of Continuous Transportation Problems (Q4008472) (← links)
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources (Q4294732) (← links)
- Preconditioning for the Geometric Transportation Problem (Q5088942) (← links)