Cycle-based reducibility of multi-index transport-type systems of linear inequalities
From MaRDI portal
(Redirected from Publication:357096)
Recommendations
- Multi-index transport problems with decomposition structure
- Three-index linear programs with nested structure
- Multiindex transportation problems with 2-embedded structure
- Multi-index transportation problems with 1-nested structure
- Solution of a locally finite system of linear inequalities with directed multigraph structure
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- scientific article; zbMATH DE number 3185418 (Why is no real title available?)
- A recognition problem in converting linear programming to network flow models
- An O (n 2 (m + N log n )log n ) min-cost flow algorithm
- Asymptotic optimality of a transport-problem plan constructed by the minimum-element method
- Beyond the flow decomposition barrier
- Complexity of a 3-dimensional assignment problem
- Extracting pure network submatrices in linear programs using signed graphs.
- Graphs of transportation polytopes
- Impaired flow multi-index transportation problem with axial constraints
- Multicommodity flows in tree-like networks
- Multicriterial multi-index resource scheduling problems
- Multiindex resource distributions for hierarchical systems
- Network flows. Theory, algorithms, and applications.
- On representatives of multi-index transportation problems
- The Relaxation Method for Linear Inequalities
This page was built for publication: Cycle-based reducibility of multi-index transport-type systems of linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q357096)
