A gradient driven transportation algorithm

DOI10.1080/00207169008803817zbMath0752.65050OpenAlexW2073954270MaRDI QIDQ4009729

Tom Altman

Publication date: 27 September 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169008803817

zbMATH Keywords

algorithmdual spacegradient methodtransportation problemdual simplex routineextended reduced gradient

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Cites Work

• A strongly polynomial minimum cost circulation algorithm
• Implementation and analysis of a variant of the dual method for the capacitated transshipment problem
• Cost operator algorithms for the transportation problem
• Recent Developments in Computer Implementation Technology for Network Flow Algorithms

This page was built for publication: A gradient driven transportation algorithm