Efficient parallel algorithms for the minimum cost flow problem
From MaRDI portal
Publication:1379929
DOI10.1023/A:1022613603828zbMath0902.90057OpenAlexW1737324853WikidataQ58921833 ScholiaQ58921833MaRDI QIDQ1379929
Francesca Guerriero, Roberto Musmanno, Patrizia Beraldi
Publication date: 5 March 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022613603828
parallel implementationsshared memory multiprocessors\(\varepsilon\)-relaxation algorithmsauction algorithmslinear minimum cost flow
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Parallel numerical computation (65Y05)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution of large dense transportation problems using a parallel primal algorithm
- Parallel primal-dual methods for the minimum cost flow problem
- The auction algorithm: A distributed relaxation method for the assignment problem
- Parallel shortest path auction algorithms
- Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations
- Efficient parallel algorithms for the minimum cost flow problem
- An auction algorithm for the max-flow problem
- The network simplex method on a multiprocessor
- Monotone networks
- Finding Minimum-Cost Circulations by Successive Approximation
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- An Auction Algorithm for Shortest Paths
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
