Towards auction algorithms for large dense assignment problems

Computational Optimization and Applications

Volumn 43, Issue 3, 2009, Pages 411-436

  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

Indexed keywords

ASSIGNMENT PROBLEMS; AUCTION ALGORITHM; AUCTION ALGORITHMS; DISTRIBUTED ALGORITHMS; DISTRIBUTED MEMORY; HIGH EFFICIENCY; LINEAR OPTIMIZATION; LINEAR SUM ASSIGNMENT PROBLEM; LINUX CLUSTERS; REVERSE AUCTION;

COMPUTER OPERATING SYSTEMS; ELECTRONIC COMMERCE; PARALLEL ALGORITHMS; TRAVELING SALESMAN PROBLEM;

PROBLEM SOLVING;

EID: 67651028073     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-007-9146-5     Document Type: Article

References (29)

1. E. Balas D. Miller J. Pekny P. Toth 1991 A parallel shortest path algorithm for the assignment problem J. ACM 38 985 1004
2. S. Belongie J. Malik J. Puzicha 2002 Shape matching and object recognition using shape contexts IEEE Trans. Pattern Anal. Mach. Intel. 24 24 509 522 (Pubitemid 34448769)
3. D. Bertsekas D. Castañon 1992 A forward/reverse auction algorithm for asymmetric assignment problems Comput. Optim. Appl. 1 3 277 297 (Pubitemid 23622892)
4. Bertsekas, D.P.: A distributed algorithm for the assignment problem. Laboratory for Information and Decision Systems Working Paper, (M.I.T.), March 1979
5. D.P. Bertsekas 1981 A new algorithm for the assignment problem Math. Program. 21 152 171
6. Bertsekas, D.P.: Linear Network Optimization: Algorithms and Codes. MIT Press, Cambridge (1991)
7. Bertsekas, D.P.: Network Optimization: Continuous and Discrete Models. Athena Scientific, Belmont (1998)
8. D.P. Bertsekas D.A. Castañon 1991 Parallel synchronous and asynchronous implementations of the auction algorithm Parallel Comput. 17 6-7 707 732
9. D.P. Bertsekas D.A. Castañon 1993 Parallel asynchronous hungarian methods for the assignment problem ORSA J. Comput. 5 261 274
10. D.P. Bertsekas D.A. Castañon H. Tsaknakis 1993 Reverse auction algorithm and the solution of inequality constrained assignment problems SIAM J. Optim. 3 268 299
11. Brady, M., Jung, K.K., Nguyen, H.T., Raghavan, R., Subramonian, R.: The assignment problem on parallel architectures. In: Network Flows and Matching. DIMACS, pp. 469-517. American Mathematical Society, Providence (1993)
12. Burkard, R.E., Çela, E.: Linear assignment problems and extensions. In: Handbook of Combinatorial Optimization, pp. 75-149. Kluwer Academic, Dordrecht (1999)
13. Buš, L., Tvrdík, P.: Look-back auction algorithm for the assignment problem and its distributed memory implementation. In: Proceedings of the 15th IASTED International Conference Parallel and Distributed Computing and Systems, pp. 551-556. Acta Press, Anaheim (2003)
14. Castañon, D.A.: Reverse auction algorithms for assignment problems. In: Network Flows and Matching. DIMACS, pp. 407-429. American Mathematical Society, Providence (1993)
15. I.S. Duff J. Koster 2001 On algorithms for permuting large entries to the diagonal of a sparse matrix SIAM J. Matrix Anal. Appl. 22 4 973 996
16. A. Frieze G. Galbiati F. Maffioli 1982 On the worst-case performance on some algorithms fo the asymmetric traveling salesman problem Networks 12 23 39 (Pubitemid 13492891)
17. F. Glover G. Gutin A. Yeo A. Zverovich 2001 Contruction heuristics and domination analysis for the asymmetric tsp Eur. J. Oper. Res. 129 555 568
18. A. Goldberg R. Kennedy 1995 An efficient cost scaling algorithm for the assignment problem Math. Program. 75 153 177
19. A. Goldberg S. Plotkin D. Shmoys E. Tardos 1992 Using interior point methods for fast parallel algorithms for bipartite matching and related problems SIAM J. Comput. 21 1 140 150
20. R. Jonker A. Volgenant 1987 A shortest augmenting path algorithm for dense and sparse linear assignment problems Computing 38 325 340 (Pubitemid 17658282)
21. Karp, R.M., Steele, J.M.: Probabilistic analysis of heuristics. In: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)
22. Korimont, T., Burkard, R., Çela, E.: An interior point approach for weighted bipartite matching. Technical Report FB196, Technische University Graz (2000)
23. H.W. Kuhn 1955 The hungarian method for the assignment and transpotation problems Nav. Res. Logist. Q. 2 83 97
24. R. Machol M. Wien 1976 A 'hard' assignment problem Oper. Res. 24 190 192
25. D.L. Miller J.F. Pekny 1991 Exact solution of large asymmetric traveling salesman problems Science 251 754 761 (Pubitemid 21926163)
26. Ramakrishnan, K.G., Karmarkar, N.K., Kamath, A.P.: An approximate dual projective algorithm for solving assignment problems. In: Network Flows and Matching. DIMACS, pp. 431-451. American Mathematical Society, Providence (1993)
27. Schütt, C., Clausen, J.: Parallel algorithms for the assignment problem-an experimental evaluation of three distributed algorithms. In: Parallel Processing of Discrete Optimization Problems. DIMACS, pp. 337-351. American Mathematical Society, Providence (1995)
28. B.L. Schwartz 1994 A computational analysis of the auction algorithm Eur. J. Oper. Res. 74 161 169
29. Zhang, W.: Truncated branch-and-bound: A case study on the asymmetric tsp. In: Proceedings of AAAI 1993 Spring Symposium: AI and NP-Hard Problems, pp. 160-166. Stanford, CA (1993)