Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm

DOI10.1287/IJOC.4.3.235MaRDI QIDQ4030924zbMATH OpenOpenAlexFDO

Authors Mustafa Ç. Pınar, Stavros A. Zenios

Publication date 1 April 1993

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.4.3.235

zbMATH Keywords

parallel implementationmulticommodity network flowparallel decomposition algorithmpiecewise linear-quadratic penalty functions

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

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

(14)

• Multicommodity network flows: A survey. II: Solution methods
• Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems
• A Parallel Projection for the Multicommodity Network Model
• A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗
• A smooth penalty function algorithm for network-structured problems
• On the Fine-Grain Decomposition of Multicommodity Transportation Problems
• Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems
• An exponential‐function reduction method for block‐angular convex programs
• Proximal minimizations with D-functions and the massively parallel solution of linear network programs
• A bundle-type algorithm for routing in telecommunication data networks
• scientific article; zbMATH DE number 176478 (Why is no real title available?)
• Modified primal path-following scheme for the monotone variational inequality problem
• Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
• Multicommodity network flows: The impact of formulation on decomposition

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)