The practical conversion of linear programmes to network flow models
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3957111 (Why is no real title available?)
- scientific article; zbMATH DE number 3307136 (Why is no real title available?)
- A Control Problem of Bellman
- A good submatrix is hard to find
- Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models
- Automatic identification of embedded network rows in large-scale optimization models
- Converting Linear Programs to Network Problems
- Determining GUB sets via an invert agenda algorithm
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Identification of special structure constraints in linear programs
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Lectures on matroids
- Optimal Capacity Scheduling—I
- Testing of a large-scale network optimization program
- The practical conversion of linear programmes to network flow models
Cited in
(6)- The out‐of‐kilter algorithm for solving network problems
- Detecting embedded pure network structures in LP problems
- A heuristic for finding embedded network structure in mathematical programmes
- The practical conversion of linear programmes to network flow models
- scientific article; zbMATH DE number 647701 (Why is no real title available?)
- A recognition problem in converting linear programming to network flow models
This page was built for publication: The practical conversion of linear programmes to network flow models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757237)
