Pivot Strategies for Primal-Simplex Network Codes

DOI10.1145/322063.322070zbMath0379.90101OpenAlexW2003203603MaRDI QIDQ4158842

John M. Mulvey

Publication date: 1978

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322063.322070

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05)

Related Items

Unnamed Item, Minimum-cost flow algorithms: an experimental evaluation, Minimal-cost network flow problems with variable lower bounds on arc flows, Unnamed Item, A primal simplex variant for the maximum-flow problem, A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals, Primal transportation and transshipment algorithms, Testing of a large-scale network optimization program, An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems, A comparison of pivot selection rules for primal simplex based network codes, New labeling procedures for the basis graph in generalized networks, A practical anti-degeneracy row selection technique in network linear programming, Solving Large Scale Generalized Networks

Uses Software

• NETGEN