Pages that link to "Item:Q4030924"
From MaRDI portal
The following pages link to Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm (Q4030924):
Displaying 13 items.
- Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems (Q1308671) (← links)
- Multicommodity network flows: The impact of formulation on decomposition (Q1321667) (← links)
- Modified primal path-following scheme for the monotone variational inequality problem (Q1372549) (← links)
- A smooth penalty function algorithm for network-structured problems (Q1388940) (← links)
- Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs (Q2366829) (← links)
- A bundle-type algorithm for routing in telecommunication data networks (Q2655403) (← links)
- Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems (Q2884565) (← links)
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
- A Parallel Projection for the Multicommodity Network Model (Q3496126) (← links)
- A PARALLEL PRIMAL-DUAL INTERIOR POINT METHOD FOR MULTICOMMODITY FLOW PROBLEMS WITH QUADRATIC COSTS (Q4347337) (← links)
- A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗ (Q4819970) (← links)
- An exponential‐function reduction method for block‐angular convex programs (Q4894869) (← links)
- (Q5020878) (← links)