Testing of a large-scale network optimization program
From MaRDI portal
Publication:4171521
DOI10.1007/BF01609034zbMath0389.65032OpenAlexW1984840780MaRDI QIDQ4171521
Publication date: 1978
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01609034
Numerical optimization and variational techniques (65K10) Deterministic network models in operations research (90B10)
Related Items
Implementation and analysis of alternative algorithms for generalized shortest path problems, Unnamed Item, Computational comparisons of dual conjugate gradient algorithms for strictly convex networks., A classroom/time assignment model, A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks, The practical conversion of linear programmes to network flow models, A comparison of pivot selection rules for primal simplex based network codes, A recognition problem in converting linear programming to network flow models, Solving Large Scale Generalized Networks, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, Representing inverses in pure network flow optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems
- 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
- A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems
- The Influence of the Compiler on the Cost of Mathematical Software—in Particular on the Cost of Triangular Factorization
- An improved version of the out-of-kilter method and a comparative study of computer codes
- Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently
- The factorization approach to large-scale linear programming
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
- A network simplex method
- The zero pivot phenomenon in transportation and assignment problems and its computational implications
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Pivot Strategies for Primal-Simplex Network Codes
- Reporting computational experiments in mathematical programming
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Augmented Threaded Index Method For Network Optimization
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- Pivot selection methods of the Devex LP code
