A gradient driven transportation algorithm

DOI10.1080/00207169008803817MaRDI QIDQ4009729zbMATH OpenOpenAlexFDO

Authors 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 simplex routinedual spaceextended reduced gradientgradient methodtransportation problem

Mathematics Subject Classification ID

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

Recommendations

• On a nonbasic dual method for the transportation problem
• scientific article; zbMATH DE number 4029256
• scientific article; zbMATH DE number 94945
• On the numerical solution of the transportation problem
• scientific article; zbMATH DE number 26752

Cites work

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

Cited in

(3)

• A research on the transportation problem based on transport order
• scientific article; zbMATH DE number 4029256 (Why is no real title available?)
• The tridiagonal transportation problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009729)