{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:19:17Z","timestamp":1765545557416},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,3,3]],"date-time":"2009-03-03T00:00:00Z","timestamp":1236038400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s10288-009-0098-8","type":"journal-article","created":{"date-parts":[[2009,3,2]],"date-time":"2009-03-02T19:36:16Z","timestamp":1236022576000},"page":"379-394","source":"Crossref","is-referenced-by-count":10,"title":["The computational complexity of bilevel assignment problems"],"prefix":"10.1007","volume":"7","author":[{"given":"Elisabeth","family":"Gassner","sequence":"first","affiliation":[]},{"given":"Bettina","family":"Klinz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,3,3]]},"reference":[{"key":"98_CR1","doi-asserted-by":"crossref","unstructured":"Anandalingam G, Friesz TL (eds) (1992) Hierarchical optimization. Annals of operations research, vol 34. J.C. Baltzer Scientific Publishing Company, Basel","DOI":"10.1007\/BF02098169"},{"key":"98_CR2","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/opre.38.3.556","volume":"38","author":"O Ben-Ayed","year":"1990","unstructured":"Ben-Ayed O, Blair CE (1990) Computational difficulties of bilevel linear programming. Oper Res 38: 556\u2013560","journal-title":"Oper Res"},{"key":"98_CR3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-1-4757-3023-4_2","volume-title":"Handbook ofcombinatorial optimization\u2014supplement, vol A","author":"RE Burkard","year":"1999","unstructured":"Burkard RE, \u00c7ela E (1999) Linear assignment problems and extensions. In: Du DZ, Pardalos PM (eds) Handbook ofcombinatorial optimization\u2014supplement, vol A. Kluwer, Dordrecht pp 75\u2013149"},{"key":"98_CR4","unstructured":"Burkard RE, Dell\u2019Amico M, Martello S (2009) Assignment problems. In: SIAM monographs on discrete mathematics and applications. Society for Industrial and Applied Mathematics (SIAM), Philadelphia"},{"key":"98_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10288-005-0071-0","volume":"3","author":"B Colson","year":"2005","unstructured":"Colson B, Marcotte P, Savard G (2005) Bilevel programming: a survey. 4OR: A Q J Oper Res 3: 87\u2013107","journal-title":"4OR: A Q J Oper Res"},{"key":"98_CR6","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1080\/0233193031000149894","volume":"52","author":"S Dempe","year":"2003","unstructured":"Dempe S (2003) Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization 52: 333\u2013359","journal-title":"Optimization"},{"key":"98_CR7","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 (1998) Complexity issues in bilevel linear programming. In: Migdalas A, Pardalos PM, V\u00e4rband P (eds) Multilevel optimization. Algorithms and applications. Kluwer, Dordrecht, pp 149\u2013164"},{"key":"98_CR8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-1-4613-0307-7_7","volume-title":"Multilevel optimization. Algorithms and applications","author":"T Dud\u00e1s","year":"1998","unstructured":"Deng X (1998) Complexity issues in bilevel linear programming. In: Migdalas A, Pardalos PM, V\u00e4rband P (eds) Multilevel optimization. Algorithms and applications. Kluwer, Dordrecht, pp 149\u2013164"},{"key":"98_CR9","volume-title":"Computers and intractability, a guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D (1979) Computers and intractability, a guide to the theory of NP-completeness. Freeman, New York"},{"key":"98_CR10","unstructured":"Gassner E (2002) Maximal spannende Baumprobleme mit einer Hierarchie von zwei Entscheidungstr\u00e4gern (in German). Diploma thesis, Department of Mathematics B, University of Technology, Graz, Austria"},{"key":"98_CR11","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1137\/0913069","volume":"13","author":"P Hansen","year":"1992","unstructured":"Hansen P, Jaumard B, Savard G (1992) New branch-and-bound rules for linear bilevel programming. SIAM J Sci Stat Comput 13: 1194\u20131217","journal-title":"SIAM J Sci Stat Comput"},{"key":"98_CR12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01586088","volume":"32","author":"R Jeroslow","year":"1985","unstructured":"Jeroslow R (1985) The polynomial hierarchy and a simple model for competitive analysis. Math Program 32: 146\u2013164","journal-title":"Math Program"},{"key":"98_CR13","volume-title":"Multilevel optimization. Algorithms and applications","year":"1998","unstructured":"Migdalas A, Pardalos PM, V\u00e4rband P (1998) Multilevel optimization. Algorithms and applications. Kluwer, Dordrecht"},{"key":"98_CR14","unstructured":"Stackelberg H von (1934) Marktform und Gleichgewicht. Springer, Berlin [engl. transl.: The theory of market economy. Oxford University Press, New York (1952)]"},{"key":"98_CR15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01096458","volume":"5","author":"LN Vicente","year":"1994","unstructured":"Vicente LN, Calamai PH (1994) Bilevel and multilevel programming: a bibliography review. J Global Optim 5: 291\u2013306","journal-title":"J Global Optim"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-009-0098-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-009-0098-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-009-0098-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:56Z","timestamp":1559131976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-009-0098-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,3]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["98"],"URL":"https:\/\/doi.org\/10.1007\/s10288-009-0098-8","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3,3]]}}}