A Strongly Convergent Primal Simplex Algorithm for Generalized Networks

DOI10.1287/MOOR.4.1.39MaRDI QIDQ3856449zbMATH OpenOpenAlexFDO

Authors Joyce Elam, Fred Glover, 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

degeneracyextended augmented predecessor index methodfinite convergencegeneralized network problemnetwork flows with gainsnetwork programmingprimal simplex algorithmstrongly convergent basis

Mathematics Subject Classification ID

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

Cited in

(7)

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

This page was built for publication: A Strongly Convergent Primal Simplex Algorithm for Generalized Networks

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