Progress Made in Solving the Multicommodity Flow Problem
From MaRDI portal
Recommendations
- Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
- Solving the undirected multicommodity flow problem using a shortest path‐based pricing algorithm
- A simple method for improving the primal simplex method for the multicommodity flow problem
- scientific article; zbMATH DE number 515936
Cited in
(14)- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- Multicommodity network flow with jump constraints
- Large-scale optimization with the primal-dual column generation method
- The simplex algorithm for multicommodity networks
- Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
- Algorithms for finding optimal flows in dynamic networks
- Solving the undirected multicommodity flow problem using a shortest path‐based pricing algorithm
- Multicommodity network flows: A survey. II: Solution methods
- A specialized network simplex algorithm for the constrained maximum flow problem
- On geometrical properties of preconditioners in IPMs for classes of block-angular problems
- A simple method for improving the primal simplex method for the multicommodity flow problem
- Inflow-dependent quickest multi-commodity flow problem with partial lane reversals
- About Lagrangian methods in integer optimization
- New methods for multi-commodity flows
This page was built for publication: Progress Made in Solving the Multicommodity Flow Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229456)
