{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:33:54Z","timestamp":1767706434313},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T00:00:00Z","timestamp":1195171200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s10589-007-9146-5","type":"journal-article","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T16:31:51Z","timestamp":1195144311000},"page":"411-436","source":"Crossref","is-referenced-by-count":16,"title":["Towards auction algorithms for large dense assignment problems"],"prefix":"10.1007","volume":"43","author":[{"given":"Libor","family":"Bu\u0161","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Tvrd\u00edk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,16]]},"reference":[{"key":"9146_CR1","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1145\/115234.115349","volume":"38","author":"E. Balas","year":"1991","unstructured":"Balas, E., Miller, D., Pekny, J., Toth, P.: A parallel shortest path algorithm for the assignment problem. J. ACM 38, 985\u20131004 (1991)","journal-title":"J. ACM"},{"issue":"24","key":"9146_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/34.993558","volume":"24","author":"S. Belongie","year":"2002","unstructured":"Belongie, S., Malik, J., Puzicha, J.: Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intel. 24(24), 509\u2013522 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intel."},{"issue":"3","key":"9146_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF00249638","volume":"1","author":"D. Bertsekas","year":"1992","unstructured":"Bertsekas, D., Casta\u00f1on, D.: A\u00a0forward\/reverse auction algorithm for asymmetric assignment problems. Comput. Optim. Appl. 1(3), 277\u2013297 (1992)","journal-title":"Comput. Optim. Appl."},{"key":"9146_CR4","unstructured":"Bertsekas, D.P.: A distributed algorithm for the assignment problem. Laboratory for Information and Decision Systems Working Paper, (M.I.T.), March 1979"},{"key":"9146_CR5","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/BF01584237","volume":"21","author":"D.P. Bertsekas","year":"1981","unstructured":"Bertsekas, D.P.: A\u00a0new algorithm for the assignment problem. Math. Program. 21, 152\u2013171 (1981)","journal-title":"Math. Program."},{"key":"9146_CR6","volume-title":"Linear Network Optimization: Algorithms and Codes","author":"D.P. Bertsekas","year":"1991","unstructured":"Bertsekas, D.P.: Linear Network Optimization: Algorithms and Codes. MIT Press, Cambridge (1991)"},{"key":"9146_CR7","volume-title":"Network Optimization: Continuous and Discrete Models","author":"D.P. Bertsekas","year":"1998","unstructured":"Bertsekas, D.P.: Network Optimization: Continuous and Discrete Models. Athena Scientific, Belmont (1998)"},{"issue":"6\u20137","key":"9146_CR8","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/S0167-8191(05)80062-6","volume":"17","author":"D.P. Bertsekas","year":"1991","unstructured":"Bertsekas, D.P., Casta\u00f1on, D.A.: Parallel synchronous and asynchronous implementations of the auction algorithm. Parallel Comput. 17(6\u20137), 707\u2013732 (1991)","journal-title":"Parallel Comput."},{"key":"9146_CR9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1287\/ijoc.5.3.261","volume":"5","author":"D.P. Bertsekas","year":"1993","unstructured":"Bertsekas, D.P., Casta\u00f1on, D.A.: Parallel asynchronous hungarian methods for the assignment problem. ORSA J. Comput. 5, 261\u2013274 (1993)","journal-title":"ORSA J. Comput."},{"key":"9146_CR10","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0803013","volume":"3","author":"D.P. Bertsekas","year":"1993","unstructured":"Bertsekas, D.P., Casta\u00f1on, D.A., Tsaknakis, H.: Reverse auction algorithm and the solution of inequality constrained assignment problems. SIAM J. Optim. 3, 268\u2013299 (1993)","journal-title":"SIAM J. Optim."},{"key":"9146_CR11","series-title":"DIMACS","first-page":"469","volume-title":"Network Flows and Matching","author":"M. Brady","year":"1993","unstructured":"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\u2013517. American Mathematical Society, Providence (1993)"},{"key":"9146_CR12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-1-4757-3023-4_2","volume-title":"Handbook of Combinatorial Optimization","author":"R.E. Burkard","year":"1999","unstructured":"Burkard, R.E., \u00c7ela, E.: Linear assignment problems and extensions. In: Handbook of Combinatorial Optimization, pp. 75\u2013149. Kluwer Academic, Dordrecht (1999)"},{"key":"9146_CR13","first-page":"551","volume-title":"Proceedings of the 15th IASTED International Conference Parallel and Distributed Computing and Systems","author":"L. Bu\u0161","year":"2003","unstructured":"Bu\u0161, L., Tvrd\u00edk, 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.\u00a0551\u2013556. Acta Press, Anaheim (2003)"},{"key":"9146_CR14","series-title":"DIMACS","first-page":"407","volume-title":"Network Flows and Matching","author":"D.A. Casta\u00f1on","year":"1993","unstructured":"Casta\u00f1on, D.A.: Reverse auction algorithms for assignment problems. In: Network Flows and Matching. DIMACS, pp.\u00a0407\u2013429. American Mathematical Society, Providence (1993)"},{"issue":"4","key":"9146_CR15","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/S0895479899358443","volume":"22","author":"I.S. Duff","year":"2001","unstructured":"Duff, I.S., Koster, J.: On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM J. Matrix Anal. Appl. 22(4), 973\u2013996 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9146_CR16","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230120103","volume":"12","author":"A. Frieze","year":"1982","unstructured":"Frieze, A., Galbiati, G., Maffioli, F.: On the worst-case performance on some algorithms fo the asymmetric traveling salesman problem. Networks 12, 23\u201339 (1982)","journal-title":"Networks"},{"key":"9146_CR17","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/S0377-2217(99)00468-3","volume":"129","author":"F. Glover","year":"2001","unstructured":"Glover, F., Gutin, G., Yeo, A., Zverovich, A.: Contruction heuristics and domination analysis for the asymmetric tsp. Eur. J. Oper. Res. 129, 555\u2013568 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9146_CR18","first-page":"153","volume":"75","author":"A. Goldberg","year":"1995","unstructured":"Goldberg, A., Kennedy, R.: An efficient cost scaling algorithm for the assignment problem. Math. Program. 75, 153\u2013177 (1995)","journal-title":"Math. Program."},{"issue":"1","key":"9146_CR19","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1137\/0221011","volume":"21","author":"A. Goldberg","year":"1992","unstructured":"Goldberg, A., Plotkin, S., Shmoys, D., Tardos, E.: Using interior point methods for fast parallel algorithms for bipartite matching and related problems. SIAM J. Comput. 21(1), 140\u2013150 (1992)","journal-title":"SIAM J. Comput."},{"key":"9146_CR20","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R. Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, A.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38, 325\u2013340 (1987)","journal-title":"Computing"},{"key":"9146_CR21","volume-title":"The Traveling Salesman Problem: A\u00a0Guided Tour of Combinatorial Optimization","author":"R.M. Karp","year":"1985","unstructured":"Karp, R.M., Steele, J.M.: Probabilistic analysis of heuristics. In: The Traveling Salesman Problem: A\u00a0Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)"},{"key":"9146_CR22","unstructured":"Korimont, T., Burkard, R., \u00c7ela, E.: An interior point approach for weighted bipartite matching. Technical Report FB196, Technische University Graz (2000)"},{"key":"9146_CR23","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment and transpotation problems. Nav. Res. Logist.\u00a0Q. 2, 83\u201397 (1955)","journal-title":"Nav. Res. Logist.\u00a0Q."},{"key":"9146_CR24","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/opre.24.1.190","volume":"24","author":"R. Machol","year":"1976","unstructured":"Machol, R., Wien, M.: A \u2018hard\u2019 assignment problem. Oper. Res. 24, 190\u2013192 (1976)","journal-title":"Oper. Res."},{"key":"9146_CR25","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1126\/science.251.4995.754","volume":"251","author":"D.L. Miller","year":"1991","unstructured":"Miller, D.L., Pekny, J.F.: Exact solution of large asymmetric traveling salesman problems. Science 251, 754\u2013761 (1991)","journal-title":"Science"},{"key":"9146_CR26","series-title":"DIMACS","first-page":"431","volume-title":"Network Flows and Matching","author":"K.G. Ramakrishnan","year":"1993","unstructured":"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.\u00a0431\u2013451. American Mathematical Society, Providence (1993)"},{"key":"9146_CR27","series-title":"DIMACS","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1090\/dimacs\/022\/15","volume-title":"Parallel Processing of Discrete Optimization Problems","author":"C. Sch\u00fctt","year":"1995","unstructured":"Sch\u00fctt, C., Clausen, J.: Parallel algorithms for the assignment problem\u2014an experimental evaluation of three distributed algorithms. In: Parallel Processing of Discrete Optimization Problems. DIMACS, pp.\u00a0337\u2013351. American Mathematical Society, Providence (1995)"},{"key":"9146_CR28","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0377-2217(94)90214-3","volume":"74","author":"B.L. Schwartz","year":"1994","unstructured":"Schwartz, B.L.: A computational analysis of the auction algorithm. Eur. J. Oper. Res. 74, 161\u2013169 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"9146_CR29","unstructured":"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.\u00a0160\u2013166. Stanford, CA (1993)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9146-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9146-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9146-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:34Z","timestamp":1559302594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9146-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,16]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["9146"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9146-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,16]]}}}