New scaling algorithms for the assignment and minimum mean cycle problems-Reference-Cited by-同舟云学术

New scaling algorithms for the assignment and minimum mean cycle problems

Published:1992-02 Issue:1-3 Volume:54 Page:41-56
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Orlin James B.,Ahuja Ravindra K.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference25 articles.

1. A.V. Aho, J.E. Hopcroft and J.B. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).

2. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, “Network flows,” in:Handbooks in Operations Research and Management Science. Vol. I: Optimization (North-Holland, Amsterdam, 1989).

3. Working Paper;D.P. Bertsekas,1979

4. D.P. Bertsekas, “The auction algorithm: a distributed relaxation method for the assignment problem,” Technical Report LIDS-P-1653, MIT (Cambridge, MA, 1987).

5. D.P. Bertsekas and J. Eckstein, “Dual coordinate step methods for linear network flow problems,”Mathematical Programming 42 (1988) 203–243.

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

1. HyLAC: Hybrid linear assignment solver in CUDA;Journal of Parallel and Distributed Computing;2024-05

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

3. Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Generalization of Phylogenetic Matching Metrics with Experimental Tests of Practical Advantages;Journal of Computational Biology;2023-03-01

5. List of Optimal Solutions of the Minimum Cost for Minimum Time Assignment Problem;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2023