PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
From MaRDI portal
Cites work
- A Minimum Delay Routing Algorithm Using Distributed Computation
- A Survey of Linear Cost Multicommodity Network Flows
- A relaxed version of Bregman's method for convex programming
- An Interior Point Method for Block Angular Optimization
- An algorithm for maximum entropy image reconstruction from noisy data
- An algorithm for the chromatic number of a graph
- An iterative row-action method for interval convex programming
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Interval-constrained matrix balancing
- Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
- Multicommodity network flows—A survey
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- On the Fine-Grain Decomposition of Multicommodity Transportation Problems
- Optimization of Burg's entropy over linear constraints
- Parallel optimization for traffic assignment
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
- Row-Action Methods for Huge and Sparse Systems and Their Applications
This page was built for publication: PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820107)
