Solving Large Scale Generalized Networks
DOI10.1080/02522667.1985.10698808zbMATH Open0566.90095OpenAlexW2317552113MaRDI QIDQ3682271FDOQ3682271
Authors: 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
Recommendations
computational experimentslarge scalenetwork optimizationAlternative pivot strategiesBig-M starting method
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Title not available (Why is that?)
- Pivot selection methods of the Devex LP code
- Pivot Strategies for Primal-Simplex Network Codes
- Testing of a large-scale network optimization program
- A decision rule for improved efficiency in solving linear programming problems with the simplex algorithm
Cited In (7)
- Solving embedded generalized network problems
- An incremental primal-dual method for generalized networks
- Solving Generalized Networks
- On the simplex algorithm for networks and generalized networks
- A survey of dynamic network flows
- Simplicial Decomposition for Convex Generalized Networks
- Vectorization and multitasking of nonlinear network programming algorithms
This page was built for publication: Solving Large Scale Generalized Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3682271)
