A recognition problem in converting linear programming to network flow models
From MaRDI portal
Recommendations
- The practical conversion of linear programmes to network flow models
- Network flow problems in constraint programming
- scientific article; zbMATH DE number 4149915
- Structural investigation of piecewise linearized network flow problems
- scientific article; zbMATH DE number 3860887
- scientific article; zbMATH DE number 3934757
- Nonlinear programming methods and network flows
- scientific article; zbMATH DE number 60242
- scientific article; zbMATH DE number 47262
- scientific article; zbMATH DE number 2166303
Cites work
- Converting Linear Programs to Network Problems
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 4117862 (Why is no real title available?)
- Packing Problems and Hypergraph Theory: A Survey
- Testing of a large-scale network optimization program
- The practical conversion of linear programmes to network flow models
Cited in
(6)- Time variant multi-objective linear fractional interval-valued transportation problem
- Multi-index transport problems with decomposition structure
- Cycle-based reducibility of multi-index transport-type systems of linear inequalities
- Multiindex transportation problems with 2-embedded structure
- Multi-index transportation problems with 1-nested structure
- Three-index linear programs with nested structure
This page was built for publication: A recognition problem in converting linear programming to network flow models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309143)