{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:38Z","timestamp":1781305058722,"version":"3.54.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_28","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:35:31Z","timestamp":1781303731000},"page":"426-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of\u00a0Bilevel Linear Programming with\u00a0a\u00a0Single Upper-Level Variable"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9723-2841","authenticated-orcid":false,"given":"Nagisa","family":"Sugishita","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2344-0960","authenticated-orcid":false,"given":"Margarida","family":"Carvalho","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","unstructured":"Basu, A., Ryan, C.T., Sankaranarayanan, S.: Mixed-integer bilevel representability. Math. Program. 185(1\u20132), 163\u2013197 (2021). https:\/\/doi.org\/10.1007\/s10107-019-01424-w","DOI":"10.1007\/s10107-019-01424-w"},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1287\/opre.38.3.556","volume":"38","author":"O Ben-Ayed","year":"1990","unstructured":"Ben-Ayed, O., Blair, C.E.: Computational difficulties of bilevel linear programming. Oper. Res. 38(3), 556\u2013560 (1990). https:\/\/doi.org\/10.1287\/opre.38.3.556","journal-title":"Oper. Res."},{"issue":"6","key":"28_CR3","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/j.orl.2023.10.006","volume":"51","author":"C Buchheim","year":"2023","unstructured":"Buchheim, C.: Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations. Oper. Res. Lett. 51(6), 618\u2013622 (2023). https:\/\/doi.org\/10.1016\/j.orl.2023.10.006","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10107-023-02043-2","volume":"208","author":"QM Bui","year":"2024","unstructured":"Bui, Q.M., Carvalho, M., Neto, J.: Asymmetry in the complexity of the multi-commodity network pricing problem. Math. Program. 208(1), 425\u2013461 (2024). https:\/\/doi.org\/10.1007\/s10107-023-02043-2","journal-title":"Math. Program."},{"key":"28_CR5","doi-asserted-by":"publisher","unstructured":"Deng, X.: Complexity issues in bilevel linear programming. Multilevel optimization: Algorithms and Applications, pp. 149\u2013164 (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0307-7_6","DOI":"10.1007\/978-1-4613-0307-7_6"},{"key":"28_CR6","doi-asserted-by":"publisher","unstructured":"Hansen, P., Jaumard, B., Savard, G.: New branch-and-bound rules for linear bilevel programming. SIAM J. Sci. Stat. Comput. 13(5), 1194\u20131217 (1992). https:\/\/doi.org\/10.1137\/0913069","DOI":"10.1137\/0913069"},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s11590-024-02156-3","volume":"19","author":"D Henke","year":"2025","unstructured":"Henke, D., Lefebvre, H., Schmidt, M., Th\u00fcrauf, J.: On coupling constraints in linear bilevel optimization. Optim. Lett. 19(3), 689\u2013697 (2025). https:\/\/doi.org\/10.1007\/s11590-024-02156-3","journal-title":"Optim. Lett."},{"key":"28_CR8","unstructured":"Henke, D., Lefebvre, H., Schmidt, M., Th\u00fcrauf, J.: On coupling constraints in pessimistic linear bilevel optimization. arXiv (2025). https:\/\/arxiv.org\/abs\/2503.01563"},{"issue":"2","key":"28_CR9","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01586088","volume":"32","author":"RG Jeroslow","year":"1985","unstructured":"Jeroslow, R.G.: The polynomial hierarchy and a simple model for competitive analysis. Math. Program. 32(2), 146\u2013164 (1985). https:\/\/doi.org\/10.1007\/BF01586088","journal-title":"Math. Program."},{"key":"28_CR10","unstructured":"Ketkov, S.S., Prokopyev, O.A.: A note on the complexity of bilevel linear programs in fixed dimensions. arXiv (2025). https:\/\/arxiv.org\/abs\/2511.15592"},{"key":"28_CR11","unstructured":"Lefebvre, H., Schmidt, M.: Exact augmented Lagrangian duality for nonconvex mixed-integer nonlinear optimization. Optimization Online (2024). https:\/\/optimization-online.org\/?p=27046"},{"issue":"4","key":"28_CR12","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra, H.W., Jr.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"28_CR13","doi-asserted-by":"publisher","unstructured":"Marcotte, P., Savard, G.: Bilevel programming: A combinatorial perspective. In: Graph Theory and Combinatorial Optimization, pp. 191\u2013217. Springer, Cham (2005). https:\/\/doi.org\/10.1007\/0-387-25592-3_7","DOI":"10.1007\/0-387-25592-3_7"},{"key":"28_CR14","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1993)"},{"key":"28_CR15","doi-asserted-by":"publisher","unstructured":"Pardalos, P.M., Schnitger, G.: Checking local optimality in constrained quadratic programming is NP-hard. Oper. Res. Lett. 7(1), 33\u201335 (1988). https:\/\/doi.org\/10.1016\/0167-6377(88)90049-1","DOI":"10.1016\/0167-6377(88)90049-1"},{"key":"28_CR16","doi-asserted-by":"publisher","unstructured":"Prokopyev, O.A., Ralphs, T.K.: On the complexity of finding locally optimal solutions in bilevel linear optimization. Oper. Res. 0(0) (2026). https:\/\/doi.org\/10.1287\/opre.2024.1411","DOI":"10.1287\/opre.2024.1411"},{"key":"28_CR17","doi-asserted-by":"publisher","unstructured":"Rodrigues, B., Carvalho, M., Anjos, M.F., Sugishita, N.: Unboundedness in bilevel optimization. Math. Program. (2026). https:\/\/doi.org\/10.1007\/s10107-026-02344-2","DOI":"10.1007\/s10107-026-02344-2"},{"key":"28_CR18","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley-Interscience series in discrete mathematics and optimization, Wiley, Chichester (1998)"},{"issue":"4","key":"28_CR19","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0377-2217(82)90202-8","volume":"11","author":"HD Sherali","year":"1982","unstructured":"Sherali, H.D.: Equivalent weights for lexicographic multi-objective programs: characterizations and computations. Eur. J. Oper. Res. 11(4), 367\u2013379 (1982). https:\/\/doi.org\/10.1016\/0377-2217(82)90202-8","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"28_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00934527","volume":"39","author":"HD Sherali","year":"1983","unstructured":"Sherali, H.D., Soyster, A.L.: Preemptive and nonpreemptive multi-objective programming: relationship and counterexamples. J. Optim. Theory Appl. 39(2), 173\u2013186 (1983). https:\/\/doi.org\/10.1007\/BF00934527","journal-title":"J. Optim. Theory Appl."},{"key":"28_CR21","unstructured":"Sugishita, N., Carvalho, M.: Complexity of bilevel linear programming with a single upper-level variable. arXiv (2025). https:\/\/arxiv.org\/abs\/2510.21126"},{"issue":"2","key":"28_CR22","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF02191670","volume":"81","author":"LN Vicente","year":"1994","unstructured":"Vicente, L.N., Savard, G., J\u00fadice, J.: Descent approaches for quadratic bilevel programming. J. Optim. Theory Appl. 81(2), 379\u2013399 (1994). https:\/\/doi.org\/10.1007\/BF02191670","journal-title":"J. Optim. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:35:34Z","timestamp":1781303734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}