Computational experience with a polynomial-time dual simplex algorithm for the transportation problem

DOI10.1016/0166-218X(86)90085-5zbMath0587.90068MaRDI QIDQ1072935

Yoshiro Ikura, Nemhauser, George I.

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

transportation problemimplementationcomputational experiencepolynomial-time dual simplex algorithmscaling of the supplies and demands

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (4)

Scaling: A general framework ⋮ Strongly polynomial simplex algorithm for bipartite vertex packing ⋮ A new scaling algorithm for the minimum cost network flow problem ⋮ Computational experience with a polynomial-time dual simplex algorithm for the transportation problem

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems

This page was built for publication: Computational experience with a polynomial-time dual simplex algorithm for the transportation problem