A new algorithm for the assignment problem-Reference-Cited by-同舟云学术

A new algorithm for the assignment problem

Published:1981-12 Issue:1 Volume:21 Page:152-171
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Bertsekas Dimitri P.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference12 articles.

1. E. Lawler,Combinatorial optimization: networks and matroids (Holt, Rinehart and Winston, 1976).

2. H.W. Kuhn, “The Hungarian method for the assignment problem”,Naval Research Logistics Quarterly 2 (1955) 83–97.

3. R.S. Barr, F. Glover and D. Klingman, “The alternating basis algorithm for assignment problems”,Mathematical Programming 13 (1977) 1.

4. G.H. Bradley, G.G. Brown and G.W. Graves, ‘Design and implementation of large scale primal transhipment algorithms”,Management Science 24 (1977) 1.

5. R.V. Helgason and J.L. Kennigton, “NETFLOW program documentation”, technical report IEOR 76011, Department of Industrial Engineering and Operations Research, Southern Methodist University (1976).

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

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

2. A lexicographic approach for solving bi-criteria bottleneck assignment problems;Decision Analytics Journal;2024-03

3. Wasserstein Dictionaries of Persistence Diagrams;IEEE Transactions on Visualization and Computer Graphics;2024-02

4. Limit distributions and sensitivity analysis for empirical entropic optimal transport on countable spaces;The Annals of Applied Probability;2024-02-01

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