A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗

DOI10.1080/10637199308915446zbMath1049.68927OpenAlexW2067774786MaRDI QIDQ4819970

A. Zenios Stavros, Mustafa Çelebi Pinar

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199308915446

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Parallel algorithms in computer science (68W10)

Uses Software

• KORBX

Cites Work

• Unnamed Item
• Computational experience with a primal-dual interior point method for linear programming
• An iterative row-action method for interval convex programming
• Proximal minimization algorithm with \(D\)-functions
• Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs
• A primal truncated newton algorithm with application to large-scale nonlinear network optimization
• Coercion Functions and Decentralized Linear Programming
• An Interior Point Method for Block Angular Optimization
• On the Fine-Grain Decomposition of Multicommodity Transportation Problems
• Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
• Simplicial decomposition in nonlinear programming algorithms
• Simplicial Decomposition for Convex Generalized Networks

This page was built for publication: A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗