Implementation of a steepest-edge primal-dual simplex method for network linear programs

DOI10.1023/A:1018905123635zbMath0911.90151OpenAlexW170265350MaRDI QIDQ1265887

Norman D. Curet

Publication date: 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018905123635

zbMATH Keywords

computational methodsnetwork flow problemtransshipmentgeneralized network problemprimal-dual simplex variantuncapacitated transportation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10)