The relax codes for linear minimum cost network flow problems-Reference-Cited by-同舟云学术

The relax codes for linear minimum cost network flow problems

Published:1988-12 Issue:1 Volume:13 Page:125-190
ISSN:0254-5330
Container-title:Annals of Operations Research
language:en
Short-container-title:Ann Oper Res

Author:

Bertsekas Dimitri P.,Tseng Paul

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Decision Sciences

Link

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

Reference16 articles.

1. D.P. Bertsekas, A unified framework for minimum cost network flow problems, LIDS Report LIDS-P-1245-A, M.I.T. (1982); also Math. Progr. 32(1985)125.

2. D.P. Bertsekas and P. Tseng, Relaxation methods for minimum cost — ordinary and generalized network flow problems, LIDS Report LIDS-P-1462, M.I.T. (1985); also Oper. Res. Journal, to appear.

3. L.R. Ford, Jr. and D.R. Fulkerson,Flows in Networks (Princeton University Press, New Jersey, 1962).

4. D.P. Bertsekas, A new algorithm for the assignment problem, Math. Progr. 21(1982)152.

5. H.A. Aashtiani and T.L. Magnanti, Implementing primal-dual network flow algorithms, Oper. Res. Center Report 055-76, M.I.T. (1976).

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

1. Efficient Flow-Based Scheduling for Geo-Distributed Simulation Tasks in Collaborative Edge and Cloud Environments;IEEE Transactions on Parallel and Distributed Systems;2022-12-01

2. Matching One Sample According to Two Criteria in Observational Studies;Journal of the American Statistical Association;2021-11-17

3. Concepts and methodologies for agricultural water management;Agricultural Water Management;2021

4. Matching Methods for Observational Studies Derived from Large Administrative Databases;Statistical Science;2020-08-01

5. Modern Algorithms for Matching in Observational Studies;Annual Review of Statistics and Its Application;2020-03-09