Pivot Strategies for Primal-Simplex Network Codes

DOI10.1145/322063.322070MaRDI QIDQ4158842zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(13)

• New labeling procedures for the basis graph in generalized networks
• A practical anti-degeneracy row selection technique in network linear programming
• Minimum-cost flow algorithms: an experimental evaluation
• A primal simplex variant for the maximum-flow problem
• Solving Large Scale Generalized Networks
• Primal transportation and transshipment algorithms
• Testing of a large-scale network optimization program
• scientific article; zbMATH DE number 1471729 (Why is no real title available?)
• scientific article; zbMATH DE number 4197775 (Why is no real title available?)
• A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals
• Minimal-cost network flow problems with variable lower bounds on arc flows
• 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

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: Pivot Strategies for Primal-Simplex Network Codes

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