Efficient parallel algorithms for the minimum cost flow problem

Journal of Optimization Theory and Applications

Volumn 95, Issue 3, 1997, Pages 501-530

  Beraldi, P ^a   Guerriero, F ^a   Musmanno, R ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Auction algorithms; Minimum cost flow problems; Network optimization; Parallel asynchronous algorithms; Shared memory multiprocessors

Indexed keywords

COMBINATORIAL OPTIMIZATION; COST ACCOUNTING; MULTIPROCESSING SYSTEMS;

ALGORITHM FOR SOLVING; ASYNCHRONOUS ALGORITHMS; AUCTION ALGORITHMS; MINIMUM COST FLOW PROBLEM; NETWORK OPTIMIZATION; PARALLEL ASYNCHRONOI ALGORITHM; PARALLEL IMPLEMENTATIONS; RELAXATION ALGORITHM; SHARED MEMORY MULTIPROCESSOR; SHORT-PATH;

MEMORY ARCHITECTURE;

EID: 0031325759     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022613603828     Document Type: Article

References (32)

1. JOHNSON, E. L., Network and Basic Solution, Operations Research, Vol. 14, pp. 619-624, 1966.
2. SRINIVASAN, V., and THOMPSON, G. L., Benefit-Cost Analysis of Coding Techniques for Primal Transportation Algorithms, Journal of the ACM, Vol. 20, pp. 194-213, 1973.
3. GLOVER, F., KARNY, D., KLINGMAN, D., and NAPIER, A., A Computational Study on Start Procedures Basis Change Criteria and Solution Algorithms for Transportation Problems, Management Science, Vol. 20, pp. 793-813, 1974.
4. MILLER, D., PEKNY, J., and THOMPSON, G. L., Solution of Large Dense Transportation Problems Using a Parallel Primal Algorithm, Technical Report, Management Science Department, Carnegie Mellon University, Pittsburgh, Pennsylvania, 1989.
5. PETERS, J., The Network Simplex Method on a Multiprocessor, Networks, Vol. 20, pp. 845-859, 1990.
6. BARR, R. S., and HICKMAN, B. L., Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup, Operations Research, Vol. 42, pp. 65-80, 1994.
7. MINTY, G. J., Monotone Networks, Proceeding of the Royal Society of London, Vol. 257A, pp. 194-212, 1960.
8. BAZARAA, M. S., JARVIS, J. J., and SHERALI, H. D., Linear Programming and Network Flows, Wiley, New York, New York, 1990.
9. BERTSEKAS, D. P., and TSENG, P., Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems, Operations Research, Vol. 36, pp. 93-114, 1988.
10. BERTSEKAS, D. P., and TSENG, P., RELAX-IV: A New and Improved Version of the RELAX Code, Report LIDS-P-2276, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1994.
11. FORD, L. R., and FULKERSON, D. R., A Primal-Dual Algorithm for the Capacitated Hitchcock Problem, Naval Research Logistic Quarterly, Vol. 4, pp. 47-54, 1957.
12. FORD, L. R., and FULKERSON, D. R., Flows in Networks, Princeton University Press, Princeton, New Jersey, 1962.
13. BERTSEKAS, D. P., and CASTANÕN, D. A., Parallel Primal-Dual Methods for the Minimum Cost Flow Problem, Computational Optimization and Applications, Vol. 2, pp. 317-336, 1993.
14. BERTSEKAS, D. P., A Distributed Algorithm for the Assignment Problem, Working Paper, Laboratory for Information and Decision System, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1979.
15. BERTSEKAS, D. P., A Distributed Asynchronous Relaxation Algorithm for the Assignment Problem, Proceedings of 24th IEEE Conference on Decision and Control, Fort Lauderdale, Florida, pp. 1703-1704, 1985.
16. BERTSEKAS, D. P., The Auction Algorithm: A Distributed Relaxation Method for the Assignment Problem, Annals of Operations Research, Vol. 14, pp. 105-123, 1988.
17. BERTSEKAS, D. P., Distributed Asynchronous Relaxation Method for Linear Network Flow Problems, Report LIDS-P-1606, Laboratory for Information and Decision System, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1986.
18. BERTSEKAS, D. P., Distributed Asynchronous Relaxation Method for Linear Network Flow Problems, Proceedings of 25th IEEE Conference on Decision and Control, Athens, Greece, pp. 2101-2106, 1986.
19. BERTSEKAS, D. P., An Auction Sequential Shortest Path Algorithm for Minimum Cost Network Flow Problems, Report LIDS-P-2146, Laboratory for Information and Decision System, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1992.
20. BERTSEKAS, D. P., Linear Network Optimization: Algorithms and Codes, MIT Press, Cambridge, Massachusetts, 1991.
21. GOLDBERG, A. V., and TARJAN, R. E., Solving Minimum Cost Flow Problems by Successive Approximation, Mathematics of Operations Research, Vol. 15, pp. 430-466, 1990.
22. BERTSEKAS, D. P., The Auction Algorithm for the Shortest Path Problem, SIAM Journal on Optimization, Vol. 1, pp. 425-447, 1991.
23. BERTSEKAS, D. P., An Auction Algorithm for the Max-Flow Problem, Journal of Optimization Theory and Applications, Vol. 87, pp. 69-102, 1995.
24. LI, X., and ZENIOS, S. A., Data-Level Parallel Solution of Min-Cost Network Flow Problems Using ∈-Relaxations, European Journal of Operational Research, Vol. 79, pp. 474-488, 1994.
25. LI, X., and ZENIOS, S. A., A Massively Parallel ∈-Relaxation Algorithm for Linear Transportation Problems, Advances in Optimization and Parallel Computing, Edited by P. M. Pardalos, Elsevier Science Publisher, Amsterdam, Netherlands, pp. 164-176, 1992.
26. NARENDRAN, B., DE LEONE, R., and TIWARI, P., An Implementation of the ∈-Relaxation Algorithm on CM-5, Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, Velen, Germany, 1993.
27. BERALDI, P., GUERRIERO, F., and MUSMANNO, R., Efficient Parallel Algorithms for the Minimum Cost Flow Problems, Technical Report PARCOLAB 7/95, Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, Rende, Italy, 1995.
28. BERTSEKAS, D. P., and TSITSIKLIS, J. N., Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, New Jersey, 1989.
29. POLYMENAKOS, L. C., and BERTSEKAS, D. P., Parallel Shortest Path Auction Algorithms, Parallel Computing, Vol. 20, pp. 1221-1247, 1994.
30. BERALDI, P., GUERRIERO, F., and MUSMANNO, R., Algoritmi Paralleli per la Soluzione di Problemi di Flusso a Costo Minimo su Reti a Grandi Dimensioni, Technical Report PARCOLAB 2/95, Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, Rende, Italy, 1995.
31. KLINGMAN, D., NAPIER, A., and STUTZ, J., NETGEN: A Program for Generating Large Scale (Un)Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems, Management Science, Vol. 20, pp. 814-822, 1974.
32. KLINGMAN, D., and MOTE, J., Computational Analysis of Large-Scale Pure Networks, Paper Presented at the Joint ORSA/TIMS National Meeting, New Orleans, Louisiana, 1987.