An evaluation of mathematical programming and minicomputers
From MaRDI portal
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Theory of software (68N99) Mathematical programming (90C99)
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3677600 (Why is no real title available?)
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- A note on two problems in connexion with graphs
- An Appraisal of Some Shortest-Path Algorithms
- Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
- 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
- Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks
- Technical Note—Shortest-Path Algorithms: A Comparison
This page was built for publication: An evaluation of mathematical programming and minicomputers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1250035)
