Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
From MaRDI portal
Recommendations
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum
- scientific article; zbMATH DE number 7071840
- Implementing a proximal algorithm for some nonlinear multicommodity flow problems
- Dual-ascent methods for large-scale multicommodity flow problems
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
- Solving Multicommodity Flow Problems by an Approximation Scheme
- PRIMAL-DUAL PROXIMAL POINT ALGORITHM FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
- scientific article; zbMATH DE number 176478
Cited in
(13)- Large-scale optimization with the primal-dual column generation method
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- Optimization in liner shipping
- Optimization in liner shipping
- Algorithms for multiplayer multicommodity flow problems
- On geometrical properties of preconditioners in IPMs for classes of block-angular problems
- Quadratic regularizations in an interior-point method for primal block-angular problems
- Dynamic bundle methods
- Chebyshev center based column generation
- Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- scientific article; zbMATH DE number 7071840 (Why is no real title available?)
- Traffic Networks and Flows over Time
This page was built for publication: Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391969)
