Solving Large Scale Generalized Networks

DOI10.1080/02522667.1985.10698808zbMath0566.90095OpenAlexW2317552113MaRDI QIDQ3682271

John M. Mulvey, Stavros A. Zenios

Publication date: 1985

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1985.10698808

zbMATH Keywords

computational experimentsnetwork optimizationlarge scaleAlternative pivot strategiesBig-M starting method

Mathematics Subject Classification ID

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

Related Items (4)

An incremental primal-dual method for generalized networks ⋮ Vectorization and multitasking of nonlinear network programming algorithms ⋮ A survey of dynamic network flows ⋮ Simplicial Decomposition for Convex Generalized Networks

Cites Work

• Unnamed Item
• A decision rule for improved efficiency in solving linear programming problems with the simplex algorithm
• 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
• Pivot selection methods of the Devex LP code

This page was built for publication: Solving Large Scale Generalized Networks