Look-back Auction Algorithm for the Assignment Problem and its Distributed Memory Implementation

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

Volumn 15, Issue 2, 2003, Pages 551-556

  Buš, Libor ^a   Tvrdík, Pavel ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

Auction Algorithm; Distributed Algorithms; Linear Optimization; Linear Sum Assignment Problem; Parallel Algorithms and Architectures

Indexed keywords

OPTIMIZATION; PARALLEL ALGORITHMS; POLYNOMIALS; STORAGE ALLOCATION (COMPUTER); TRAVELING SALESMAN PROBLEM;

AUCTION ALGORITHMS; DISTRIBUTED ALGORITHMS; LINEAR OPTIMIZATION; LINEAR SUM ASSIGNMENT PROBLEM; PARALLEL ALGORITHMS AND ARCHITECTURES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 1542432970     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. R.E. Burkard and E.Çela, Linear Assignment Problems and Extensions, in P.M. Pardalos and D.-Z. Du (Ed.), Handbook of Combinatorial Optimization (Dordreck: Kluwer Academic Publishers, 1999) 75-149.
2. A.V. Goldberg and R. Kennedy, An efficient cost scaling algorithm for the assignment problem, Mathematical Programming, 75, 1995, 153-177.
3. D.A. Castañon, Reverse Auction Algorithms for Assignment Problems, in D.S. Johnson and C.C. McGeoch (Ed.), Network flows and matching (American Mathematical Society, DIMACS, 1993) 407-429.
4. R. Jonker, A. Volgenant, A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems, Computing, 38, 1987, 325-340.
5. K. G. Ramakrishnan, N. K. Karmarkar and A. P. Kamath, An Approximate Dual Projective Algorithm for Solving Assignment Problems, in D.S. Johnson and C.C. McGeoch (Ed.), Network flows and matching (American Mathematical Society, DIMACS, 1993) 431-451.
6. A.V. Goldberg, S.A. Plotkin, D.B. Shmoys and E. Tardos, Using Interior Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems, SIAM J. Computing, 21(1), 1992, 140-150.
7. E. Balas, D. Miller, J. Pekny and P. Toth, A parallel shortest path algorithm for the assignment problem, Journal of the ACM, 38(4), 1991, 985-1004.
8. D.P. Bertsekas, D.A. Castanon, Parallel Asynchronous Hungarian Methods for the Assignment Problem, ORSA Journal on Computing, 5, 1993, 261-274.
9. D.P. Bertsekas and D.A. Castañon, Parallel synchronous and asynchronous implementations of the auction algorithm, Parallel Computing, 17(6-7), 1991, 707-732.
10. Ch. Schütt and J. Clausen, Parallel Algorithms for the Assignment Problem - an Experimental Evaluation of Three Distributed Algorithms, in P.M. Pardalos, M.G.C. Resende and K.G. Ramakrishnan (Ed.), Parallel Processing of Discrete Optimization Problems (American Mathematical Society, DIMACS, 1995) 337-351.
11. M. Brady, K.K. Jung, H.T. Nguyen, R. Raghavan and R. Subramonian, The Assignment Problem on Parallel Architectures, in D.S. Johnson and C.C. McGeoch (Ed.), Network flows and matching (American Mathematical Society, DIMACS, 1993) 469-517.
12. L.Buš and P.Tvrdík, Distributed Memory Auction Algorithm for the Linear Assignment Problem, In Proceedings of 14th IASTED International Conference of Parallel and Distributed Computing and Systems, Cambridge, USA, 2002, 137-142.
13. D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods (New Jersey: Prentice-Hall Inc, 1989).
14. B.L. Schwartz, A computational analysis of the auction algorithm, European Journal of Operational Research, 74, 1994, 161-169.
15. A.T. Ernst, M.Krishnamoorthy and H.P. Nott, Dual Updates Used in the Auction Algorithm for Two Dimensional Assignment, In Proceedings of 15th National Conference of the Australian Society for Operational Research Inc., Gold Coast, Australia, 1999, 453-468.