On a nonbasic dual method for the transportation problem
From MaRDI portal
Recommendations
Cited in
(22)- Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
- Nondominated solutions of cost-time trade-off transportation and assignment problems
- Combinatoric classes of the transportation problem and their properties
- A new dual based procedure for the transportation problem
- Solution of constrained generalized transportation problems using the pivot and probe algorithm
- Obtaining a good primal solution to the uncapacitated transportation problem
- scientific article; zbMATH DE number 4199970 (Why is no real title available?)
- scientific article; zbMATH DE number 4145239 (Why is no real title available?)
- Advantageous Properties of Dual Transhipment Polyhedra
- An algorithm for solving the transportation problem
- A dual-matrix approach to the transportation problem
- A research on the transportation problem based on transport order
- scientific article; zbMATH DE number 4025159 (Why is no real title available?)
- scientific article; zbMATH DE number 4035568 (Why is no real title available?)
- Transportation problems which can be solved by the use of hirsch-paths for the dual problems
- A gradient driven transportation algorithm
- scientific article; zbMATH DE number 94945 (Why is no real title available?)
- scientific article; zbMATH DE number 1308812 (Why is no real title available?)
- scientific article; zbMATH DE number 894763 (Why is no real title available?)
- A non improving simplex algorithm for transportation problems
- scientific article; zbMATH DE number 6274096 (Why is no real title available?)
- A Treatment of Transportation Problems by Primal Partition Programming
This page was built for publication: On a nonbasic dual method for the transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3737227)