Solving large scale multicommodity networks using linear-quadratic penalty functions
From MaRDI portal
Recommendations
- A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows
- Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
- A smooth penalty function algorithm for network-structured problems
- scientific article; zbMATH DE number 1552018
- scientific article; zbMATH DE number 4199934
Cited in
(11)- LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
- A smooth penalty function algorithm for network-structured problems
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- A scaling algorithm for multicommodity flow problems
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
- A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows
- scientific article; zbMATH DE number 1552018 (Why is no real title available?)
- Multicommodity network flows: A survey. II: Solution methods
- scientific article; zbMATH DE number 7071840 (Why is no real title available?)
This page was built for publication: Solving large scale multicommodity networks using linear-quadratic penalty functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035640)
