Testing of a large-scale network optimization program

DOI10.1007/BF01609034MaRDI QIDQ4171521zbMATH OpenOpenAlexFDO

Authors John M. Mulvey

Publication date 1978

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01609034

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Deterministic network models in operations research (90B10)

Cites work

• A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems
• A decision rule for improved efficiency in solving linear programming problems with the simplex algorithm
• A network simplex method
• 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
• An improved version of the out-of-kilter method and a comparative study of computer codes
• Augmented Threaded Index Method For Network Optimization
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• scientific article; zbMATH DE number 3175708 (Why is no real title available?)
• scientific article; zbMATH DE number 3538744 (Why is no real title available?)
• scientific article; zbMATH DE number 3612766 (Why is no real title available?)
• scientific article; zbMATH DE number 3614493 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Pivot selection methods of the Devex LP code
• Pivot Strategies for Primal-Simplex Network Codes
• Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently
• Reporting computational experiments in mathematical programming
• The factorization approach to large-scale linear programming
• The Influence of the Compiler on the Cost of Mathematical Software—in Particular on the Cost of Triangular Factorization
• The stepping stone method of explaining linear programming calculations in transportation problems
• The zero pivot phenomenon in transportation and assignment problems and its computational implications

Cited in

(11)

• Representing inverses in pure network flow optimization
• Implementation and analysis of alternative algorithms for generalized shortest path problems
• A classroom/time assignment model
• A recognition problem in converting linear programming to network flow models
• Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
• Solving Large Scale Generalized Networks
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• scientific article; zbMATH DE number 1444279 (Why is no real title available?)
• The practical conversion of linear programmes to network flow models
• A comparison of pivot selection rules for primal simplex based network codes

Describes a project that uses

Uses Software

• DEVEX

This page was built for publication: Testing of a large-scale network optimization program

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