Parallel primal-dual methods for the minimum cost flow problem-Reference-Cited by-同舟云学术

Parallel primal-dual methods for the minimum cost flow problem

Published:1993-12 Issue:4 Volume:2 Page:317-336
ISSN:0926-6003
Container-title:Computational Optimization and Applications
language:en
Short-container-title:Comput Optim Applic

Author:

Bertsekas Dimitri P.,Casta�on David A.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Control and Optimization

Link

http://link.springer.com/content/pdf/10.1007/BF01299544.pdf

Reference16 articles.

1. Handbooks in Operations Research and Management Science;R. K. Ahuja,1989

2. E. Balas, D. Miller, J. Pekny, and P. Toth, ?A parallel shortest part algorithm for the assign problem,? J. ACM, Vol. 34, pp. 985?1004, 1991.

3. D. P. Bertsekas, ?A unified framework for minimum cost network flow problems,? Math. Programming, pp. 125?145, 1985.

4. D. P. Bertsekas, Linear Network Optimization: Algorithms and Codes, MIT Press: Cambridge, MA, 1991.

5. D. P. Bertsekas, and D. A. Castañon, ?Parallel asynchronous Hungarian methods for the assignment problem,? Alphatech Report, Feb. 1990, (to appear in ORSA J. of Comput).

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New auction algorithms for the assignment problem and extensions;Results in Control and Optimization;2024-03

2. Multi-granularity hybrid parallel network simplex algorithm for minimum-cost flow problems;The Journal of Supercomputing;2020-03-04

3. Robotic Networks, Distributed Algorithms for;Mathematics of Complexity and Dynamical Systems;2012

4. Trends in Networked Control Systems;IFAC Proceedings Volumes;2008

5. Efficient Parallel Algorithms for the Minimum Cost Flow Problem;Journal of Optimization Theory and Applications;1997-12