Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
From MaRDI portal
Recommendations
- A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows
- scientific article; zbMATH DE number 176478
- scientific article; zbMATH DE number 1552018
- A Parallel Projection for the Multicommodity Network Model
- A smooth penalty function algorithm for network-structured problems
Cited in
(16)- Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems
- Multicommodity network flows: The impact of formulation on decomposition
- Modified primal path-following scheme for the monotone variational inequality problem
- A smooth penalty function algorithm for network-structured problems
- Proximal minimizations with D-functions and the massively parallel solution of linear network programs
- Alternating direction splittings for block angular parallel optimization
- A bundle-type algorithm for routing in telecommunication data networks
- Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
- A Parallel Projection for the Multicommodity Network Model
- On the Fine-Grain Decomposition of Multicommodity Transportation Problems
- scientific article; zbMATH DE number 176478 (Why is no real title available?)
- A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows
- A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗
- An exponential‐function reduction method for block‐angular convex programs
- Multicommodity network flows: A survey. II: Solution methods
This page was built for publication: Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030924)