{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T19:45:26Z","timestamp":1781552726332,"version":"3.54.5"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,11,11]],"date-time":"2015-11-11T00:00:00Z","timestamp":1447200000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"AFRL\/RW","award":["FA8651-12-2-0008"],"award-info":[{"award-number":["FA8651-12-2-0008"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10589-015-9799-4","type":"journal-article","created":{"date-parts":[[2015,11,11]],"date-time":"2015-11-11T08:59:45Z","timestamp":1447232385000},"page":"215-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Exact solution approaches for bilevel assignment problems"],"prefix":"10.1007","volume":"64","author":[{"given":"Behdad","family":"Beheshti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oleg A.","family":"Prokopyev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eduardo L.","family":"Pasiliao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,11]]},"reference":[{"issue":"2","key":"9799_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0166-218X(90)90099-X","volume":"26","author":"R Aboudi","year":"1990","unstructured":"Aboudi, R., J\u00f8rnsten, K.: Resource constrained assignment problems. Discret. Appl. Math. 26(2), 175\u2013191 (1990)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"9799_CR2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1287\/ijoc.1030.0059","volume":"17","author":"RM Aiex","year":"2005","unstructured":"Aiex, R.M., Resende, M.G.C., Pardalos, P.M., Toraldo, G.: GRASP with path relinking for three-index assignment. INFORMS J. Comput. 17(2), 224\u2013247 (2005)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"9799_CR3","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1287\/mnsc.10.3.578","volume":"10","author":"ML Balinski","year":"1964","unstructured":"Balinski, M.L., Gomory, R.E.: A primal method for the assignment and transportation problems. Manag. Sci. 10(3), 578\u2013593 (1964)","journal-title":"Manag. Sci."},{"key":"9799_CR4","unstructured":"Beheshti, B.: Test instances for the bilevel assignment problem. http:\/\/www.pitt.edu\/droleg\/files\/BAP.html . Accessed April 6, 2014"},{"issue":"1","key":"9799_CR5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discret. Appl. Math. 123(1), 155\u2013225 (2002)","journal-title":"Discret. Appl. Math."},{"key":"9799_CR6","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment Problems","author":"R Burkard","year":"2009","unstructured":"Burkard, R., Dell\u2019Amico, M., Martello, S.: Assignment Problems. Society for Industrial Mathematics, Philadelphia (2009)"},{"issue":"2","key":"9799_CR7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(87)90017-5","volume":"18","author":"CR Chegireddy","year":"1987","unstructured":"Chegireddy, C.R., Hamacher, H.W.: Algorithms for finding $$k$$ k -best perfect matchings. Discret. Appl. Math. 18(2), 155\u2013165 (1987)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9799_CR8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B Colson","year":"2007","unstructured":"Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Ann. Oper. Res. 153(1), 235\u2013256 (2007)","journal-title":"Ann. Oper. Res."},{"key":"9799_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-1-4613-0307-7_6","volume-title":"Multilevel Optimization: Algorithms and Applications","author":"X Deng","year":"1998","unstructured":"Deng, X.: Complexity issues in bilevel linear programming. In: Migdalas, A., Pardalos, P.M., Varbrand, P. (eds.) Multilevel Optimization: Algorithms and Applications, pp. 149\u2013164. Kluwer Academic Publishers, Dordrecht (1998)"},{"issue":"5","key":"9799_CR10","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1002\/net.3230220504","volume":"22","author":"K Fukuda","year":"1992","unstructured":"Fukuda, K., Matsui, T.: Finding all minimum-cost perfect matchings in bipartite graphs. Networks 22(5), 461\u2013468 (1992)","journal-title":"Networks"},{"issue":"7","key":"9799_CR11","doi-asserted-by":"crossref","first-page":"1747","DOI":"10.1287\/opre.19.7.1747","volume":"19","author":"RS Garfinkel","year":"1971","unstructured":"Garfinkel, R.S.: An improved algorithm for the bottleneck assignment problem. Oper. Res. 19(7), 1747\u20131751 (1971)","journal-title":"Oper. Res."},{"issue":"4","key":"9799_CR12","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10288-009-0098-8","volume":"7","author":"E Gassner","year":"2009","unstructured":"Gassner, E., Klinz, B.: The computational complexity of bilevel assignment problems. 4OR Q. J. Oper. Res. 7(4), 379\u2013394 (2009)","journal-title":"4OR Q. J. Oper. Res."},{"issue":"4","key":"9799_CR13","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F Glover","year":"1975","unstructured":"Glover, F.: Improved linear integer programming formulations of nonlinear integer problems. Manag. Sci. 22(4), 455\u2013460 (1975)","journal-title":"Manag. Sci."},{"key":"9799_CR14","first-page":"1755","volume":"10","author":"DE King","year":"2009","unstructured":"King, D.E.: Dlib-ml: a machine learning toolkit. J. Mach. Learn. Res. 10, 1755\u20131758 (2009)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"9799_CR15","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s11590-010-0198-6","volume":"5","author":"PA Krokhmal","year":"2011","unstructured":"Krokhmal, P.A.: On optimality of a polynomial algorithm for random linear multidimensional assignment problem. Optim. Lett. 5(1), 153\u2013164 (2011)","journal-title":"Optim. Lett."},{"issue":"1","key":"9799_CR16","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.ejor.2005.05.028","volume":"176","author":"PMD Lieshout","year":"2007","unstructured":"Lieshout, P.M.D., Volgenant, A.: A branch-and-bound algorithm for the singly constrained assignment problem. Eur. J. Oper. Res. 176(1), 151\u2013164 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9799_CR17","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/0377-2217(94)00005-W","volume":"81","author":"YH Liu","year":"1995","unstructured":"Liu, Y.H., Spencer, T.H.: Solving a bilevel linear program when the inner decision maker controls few variables. Eur. J. Oper. Res. 81(3), 644\u2013651 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"9799_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0307-7","volume-title":"Multilevel Optimization: Algorithms and Applications","author":"A Migdalas","year":"1998","unstructured":"Migdalas, A., Pardalos, P.M., V\u00e4rbrand, P.: Multilevel Optimization: Algorithms and Applications, vol. 20. Springer, Berlin (1998)"},{"issue":"3","key":"9799_CR19","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1287\/opre.16.3.682","volume":"16","author":"KG Murty","year":"1968","unstructured":"Murty, K.G.: An algorithm for ranking all the assignments in order of increasing cost. Oper. Res. 16(3), 682\u2013687 (1968)","journal-title":"Oper. Res."},{"key":"9799_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3155-2","volume-title":"Nonlinear Assignment Problems: Algorithms and Applications","author":"PM Pardalos","year":"2000","unstructured":"Pardalos, P.M., Pitsoulis, L.: Nonlinear Assignment Problems: Algorithms and Applications, vol. 7. Springer, Berlin (2000)"},{"issue":"11","key":"9799_CR21","doi-asserted-by":"crossref","first-page":"3714","DOI":"10.1016\/j.cor.2007.04.008","volume":"35","author":"CR Pedersen","year":"2008","unstructured":"Pedersen, C.R., Relund Nielsen, L., Andersen, K.A.: An algorithm for ranking assignments using reoptimization. Comput. Oper. Res. 35(11), 3714\u20133726 (2008)","journal-title":"Comput. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9799-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-015-9799-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9799-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:37:41Z","timestamp":1559241461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-015-9799-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,11]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["9799"],"URL":"https:\/\/doi.org\/10.1007\/s10589-015-9799-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,11]]}}}