An evaluation of mathematical programming and minicomputers
From MaRDI portal
Publication:1250035
DOI10.1016/0377-2217(79)90047-XzbMath0387.90110MaRDI QIDQ1250035
Joyce Elam, John M. Mulvey, Darwin D. Klingman
Publication date: 1979
Published in: European Journal of Operational Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Mathematical programming (90C99) Theory of software (68N99) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
- Technical Note—Shortest-Path Algorithms: A Comparison
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Implementation and efficiency of Moore-algorithms for the shortest route problem
- An Appraisal of Some Shortest-Path Algorithms
