A partitioning algorithm for the multicommodity network flow problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3167494 (Why is no real title available?)
- scientific article; zbMATH DE number 3209723 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- scientific article; zbMATH DE number 3363322 (Why is no real title available?)
- scientific article; zbMATH DE number 3188097 (Why is no real title available?)
- A Dual Generalized Upper Bounding Technique
- A Treatment of Transportation Problems by Primal Partition Programming
- A decomposition method for structured linear and nonlinear programs
- A generalized upper bounding algorithm for multicommodity network flow problems
- A suggested computation for maximal multi-commodity network flows
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Minimum Concave Cost Flows in Certain Networks
- Multi-Commodity Network Flows
- Primal partition programming for block diagonal matrices
- The Decomposition Algorithm for Linear Programs
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
Cited in
(5)- Large-scale linear programming: Geometry, working bases and factorizations
- Multicommodity network flows: A survey. II: Solution methods
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
- A linear model for compound multicommodity network flow problems
- A minimum-cost multicommodity network flow problem concerning imports and exports
This page was built for publication: A partitioning algorithm for the multicommodity network flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5668269)
