{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:37:55Z","timestamp":1759847875472},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1007\/bf02684443","type":"journal-article","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T01:04:05Z","timestamp":1186535045000},"page":"237-258","source":"Crossref","is-referenced-by-count":19,"title":["Solution methods and computational investigations for the Linear Bottleneck Assignment Problem"],"prefix":"10.1007","volume":"59","author":[{"given":"U.","family":"Pferschy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02684443_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(91)90195-N","volume":"37","author":"H. Alt","year":"1991","unstructured":"Alt, H., Blum, N., Mehlhorn, K., Paul, M.: Computing a maximum cardinality matching in a bipartite graph in timeO(n 1.5\u221am\/logn). Inf. Proc. Lett.37, 237\u2013240 (1991).","journal-title":"Inf. Proc. Lett."},{"key":"BF02684443_CR2","first-page":"47","volume":"28","author":"B. Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s, B., Thomason, A.: Random graphs of small order. Random Graphs, \u201983. Ann. Disc. Math.28, 47\u201397 (1985).","journal-title":"Ann. Disc. Math."},{"key":"BF02684443_CR3","doi-asserted-by":"crossref","unstructured":"Burkard, R. E., Derigs, U.: Assignment and matching problems: solution methods with Fortran-programs. Springer Lecture Notes Econ. Math. Sys.184 (1980).","DOI":"10.1007\/978-3-642-51576-7"},{"key":"BF02684443_CR4","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF02243552","volume":"27","author":"G. Carpaneto","year":"1981","unstructured":"Carpaneto, G., Toth, P.: Algorithm for the solution of the bottleneck assignment problem. Computing27, 179\u2013187 (1981).","journal-title":"Computing"},{"key":"BF02684443_CR5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02247938","volume":"31","author":"G. Carpaneto","year":"1983","unstructured":"Carpaneto, G., Toth, P.: Algorithm for the solution of the assignment problem for sparse matrices. Computing31, 83\u201394 (1983).","journal-title":"Computing"},{"key":"BF02684443_CR6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02240182","volume":"33","author":"U. Derigs","year":"1984","unstructured":"Derigs, U.: Alternate strategies for solving bottleneck assignment problems \u2014 analysis and computational results. Computing33, 95\u2013106 (1984).","journal-title":"Computing"},{"key":"BF02684443_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02022037","volume":"4","author":"U. Derigs","year":"1985","unstructured":"Derigs, U.: The shortest augmenting path method for solving assignment problems. Ann. Oper. Res.4, 57\u2013102 (1985).","journal-title":"Ann. Oper. Res."},{"key":"BF02684443_CR8","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF02240205","volume":"36","author":"U. Derigs","year":"1986","unstructured":"Derigs, U., Metz, A.: An efficient labeling technique for solving sparse assignment problems. Computing36, 301\u2013311 (1986).","journal-title":"Computing"},{"key":"BF02684443_CR9","first-page":"181","volume":"30","author":"U. Derigs","year":"1986","unstructured":"Derigs, U., Metz, A.: An in-core\/out-of-core method for solving large scale assignment problems. Z. Oper. Res.30, 181\u2013195 (1986).","journal-title":"Z. Oper. Res."},{"key":"BF02684443_CR10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02252026","volume":"19","author":"U. Derigs","year":"1978","unstructured":"Derigs, U., Zimmermann, U.: An augmenting path method for solving linear bottleneck assignment problems. Computing19, 285\u2013295 (1978).","journal-title":"Computing"},{"key":"BF02684443_CR11","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0196-6774(88)90031-4","volume":"9","author":"H. N. Gabow","year":"1988","unstructured":"Gabow, H. N., Tarjan, R. E.: Algorithms for two bottleneck optimization problems. J. Algorithms9, 411\u2013417 (1988).","journal-title":"J. Algorithms"},{"key":"BF02684443_CR12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"Hopcroft, J. E., Karp, R. M.: Ann 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput2, 225\u2013231 (1973).","journal-title":"SIAM J. Comput"},{"key":"BF02684443_CR13","volume-title":"Graphical Evolution","author":"E.M. Palmer","year":"1985","unstructured":"Palmer, E.M.: Graphical Evolution. New York: J. Wiley 1985."},{"key":"BF02684443_CR14","doi-asserted-by":"crossref","unstructured":"Pferschy, U.: The random linear bottleneck assignment problem. In: Proc. of the 4. IPCO Conference, (Balas, E., Clausen, J., eds.). Springer Lecture Notes in Computer Science920, 145\u2013156 (1995) and RAIRO30, 127\u2013142 (1996).","DOI":"10.1051\/ro\/1996300201271"},{"key":"BF02684443_CR15","unstructured":"Pferschy, U.: On three topics in combinatorial optimization, Chapter 4. PhD-thesis, Report 300, Institute of Mathematics, University of Technology Graz 1995."},{"key":"BF02684443_CR16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0166-218X(94)90039-6","volume":"55","author":"A. P. Punnen","year":"1994","unstructured":"Punnen, A. P., Nair, K. P. K.: Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem. Discr. Appl. Math.55, 91\u201393 (1994).","journal-title":"Discr. Appl. Math."},{"key":"BF02684443_CR17","unstructured":"Taillard, E. D.: Comparison of iterative searches for the quadratic assignment problem. Centre de recherche sur les transports, CRT-989, Universit\u00e9 de Montr\u00e9al, 1994."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684443.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02684443\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T18:22:39Z","timestamp":1558203759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02684443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["BF02684443"],"URL":"https:\/\/doi.org\/10.1007\/bf02684443","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}