Author:
Damberg Olof,Storøy Sverre,Sørevik Tor
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization
Reference35 articles.
1. G. Amdahl. Validity of the single processor approach to achieving large scale computing capabilities. In AFIPS Conference proceedings, Washington D.C., 1967, Thompson Books.
2. E. Balas, D. Miller, J. Pekny, and P. Toth. A parallel shortest path algorithm for the assignment problem. J. Assoc. Comput. Mach., 38:985–1004, 1991.
3. R. Barr, F. Glover, and D. Klingman. The alternating basis algorithm for the assignment problem. Math. Programming, 13:1–13, 1977.
4. R. Barr, F. Glover, and D. Klingman. A new alternating basis algorithm for semi-assignment networks. In W. White, editor, Computers and Mathematical Programming, pages 223–232. National Bureau of Standards Special Publication, U.S. Government Printing Office, Washington D.C., 1978.
5. D. P. Bertsekas. The auction algorithm: A distributed relaxation method for the assignment problem. Ann. Oper. Res., 14:105–123, 1988.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献