A comparison of pivot selection rules for primal simplex based network codes

DOI10.1016/0167-6377(83)90025-1MaRDI QIDQ794141zbMATH OpenOpenAlexFDO

Authors David Gibby, Fred Glover, Melissa Mead, Darwin D. Klingman

Publication date 1983

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(83)90025-1

zbMATH Keywords

comparisonnetwork codespivot selection rulesprimal simplex specializationtests

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• A new pivot selection rule for the network simplex algorithm
• scientific article; zbMATH DE number 1086915
• scientific article; zbMATH DE number 1766755
• scientific article; zbMATH DE number 4174642
• scientific article; zbMATH DE number 1003246

Cites work

• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Pivot Strategies for Primal-Simplex Network Codes
• Testing of a large-scale network optimization program

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: A comparison of pivot selection rules for primal simplex based network codes

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