A Strongly Convergent Primal Simplex Algorithm for Generalized Networks

DOI10.1287/moor.4.1.39zbMath0422.90081OpenAlexW2139469174MaRDI QIDQ3856449

Fred Glover, Joyce Elam, Darwin D. Klingman

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1287/moor.4.1.39

zbMATH Keywords

network programmingdegeneracyfinite convergenceprimal simplex algorithmgeneralized network problemextended augmented predecessor index methodnetwork flows with gainsstrongly convergent basis

Mathematics Subject Classification ID

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

Related Items

Implementation and analysis of alternative algorithms for generalized shortest path problems, Roof duality for polynomial 0–1 optimization, A survey of dynamic network flows, A modeling/solution approach for optimal deployment of a weapons arsenal, Determinacy in Linear Systems and Networks, New labeling procedures for the basis graph in generalized networks, Studies of lexicography in the generalized network simplex method