PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
From MaRDI portal
Publication:4820107
DOI10.1080/10637199508915508zbMath1049.68875OpenAlexW2046846731MaRDI QIDQ4820107
Emmanuel D. Chajakis, Stavros A. Zenios, Yair Censor
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/10637199508915508
Deterministic network models in operations research (90B10) Parallel algorithms in computer science (68W10)
Uses Software
Cites Work
- An algorithm for maximum entropy image reconstruction from noisy data
- Optimization of Burg's entropy over linear constraints
- Interval-constrained matrix balancing
- A relaxed version of Bregman's method for convex programming
- Parallel optimization for traffic assignment
- An iterative row-action method for interval convex programming
- Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
- An Interior Point Method for Block Angular Optimization
- On the Fine-Grain Decomposition of Multicommodity Transportation Problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- A Minimum Delay Routing Algorithm Using Distributed Computation
- A Survey of Linear Cost Multicommodity Network Flows
- Multicommodity network flows—A survey
- An algorithm for the chromatic number of a graph
