{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T16:36:26Z","timestamp":1783096586963,"version":"3.54.6"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031931116","type":"print"},{"value":"9783031931123","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-93112-3_19","type":"book-chapter","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T04:56:09Z","timestamp":1749531369000},"page":"256-269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Completeness in\u00a0the\u00a0Polynomial Hierarchy for\u00a0Many Natural Problems in\u00a0Bilevel and\u00a0Robust Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7789-8870","authenticated-orcid":false,"given":"Christoph","family":"Gr\u00fcne","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7139-4092","authenticated-orcid":false,"given":"Lasse","family":"Wulf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,4]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.disopt.2007.11.008","volume":"5","author":"H Aissi","year":"2008","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Complexity of the min-max (regret) versions of min cut problems. Discret. Optim. 5(1), 66\u201373 (2008)","journal-title":"Discret. Optim."},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/ijoc.12.2.104.11897","volume":"12","author":"I Averbakh","year":"2000","unstructured":"Averbakh, I., Berman, O.: Minmax regret median location on a network under uncertainty. INFORMS J. Comput. 12(2), 104\u2013110 (2000)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0166-218X(03)00462-1","volume":"138","author":"I Averbakh","year":"2004","unstructured":"Averbakh, I., Lebedev, V.: Interval data minmax regret network optimization problems. Discret. Appl. Math. 138(3), 289\u2013301 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00373-013-1380-2","volume":"31","author":"C Bazgan","year":"2015","unstructured":"Bazgan, C., Bentz, C., Picouleau, C., Ries, B.: Blockers for the stability number and the chromatic number. Graphs Comb. 31(1), 73\u201390 (2015)","journal-title":"Graphs Comb."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Bazgan, C., Toubaline, S., Tuza, Z.: Complexity of most vital nodes for independent set in graphs related to tree structures. In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, pp. 154\u2013166","DOI":"10.1007\/978-3-642-19222-7_17"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Bazgan, C., Toubaline, S., Vanderpooten, D.: Complexity of determining the most vital elements for the 1-median and 1-center location problems. In: Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Part I, pp. 237\u2013251","DOI":"10.1007\/978-3-642-17458-2_20"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Ghaoui, L.E., Nemirovski, A.: Robust Optimization, Princeton Series in Applied Mathematics, vol.\u00a028. Princeton University Press, Princeton (2009)","DOI":"10.1515\/9781400831050"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1137\/130906593","volume":"24","author":"A Caprara","year":"2014","unstructured":"Caprara, A., Carvalho, M., Lodi, A., Woeginger, G.J.: A study on the computational complexity of the bilevel knapsack problem. SIAM J. Optim. 24(2), 823\u2013838 (2014)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ejor.2017.08.013","volume":"265","author":"AB Chassein","year":"2018","unstructured":"Chassein, A.B., Goerigk, M., Kasperski, A., Zielinski, P.: On recoverable and two-stage robust selection problems with budgeted uncertainty. Eur. J. Oper. Res. 265(2), 423\u2013436 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10589-022-00391-x","volume":"83","author":"AA Coco","year":"2022","unstructured":"Coco, A.A., Santos, A.C., Noronha, T.F.: Robust min-max regret covering problems. Comput. Optim. Appl. 83(1), 111\u2013141 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.disopt.2010.03.008","volume":"7","author":"VG Deineko","year":"2010","unstructured":"Deineko, V.G., Woeginger, G.J.: Pinpointing the complexity of the interval min-max regret knapsack problem. Discret. Optim. 7(4), 191\u2013196 (2010)","journal-title":"Discret. Optim."},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"Dempe, S., Zemkoho, A. (eds.): Bilevel Optimization. SOIA, vol. 161. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52119-6","DOI":"10.1007\/978-3-030-52119-6"},{"key":"19_CR13","unstructured":"Denegre, S.: Interdiction and Discrete Bilevel Linear Programming. Ph.D. thesis, USA (2011). aAI3456385"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2021.04.007","volume":"871","author":"N Fr\u00f6hlich","year":"2021","unstructured":"Fr\u00f6hlich, N., Ruzika, S.: On the hardness of covering-interdiction problems. Theor. Comput. Sci. 871, 1\u201315 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Ganesh, A., Maggs, B.M., Panigrahi, D.: Robust algorithms for TSP and steiner tree. ACM Trans. Algorithms 19(2), 12:1\u201312:37 (2023)","DOI":"10.1145\/3570957"},{"key":"19_CR16","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejor.2021.12.046","volume":"302","author":"M Goerigk","year":"2022","unstructured":"Goerigk, M., Lendl, S., Wulf, L.: Two-stage robust optimization problems with two-stage uncertainty. Eur. J. Oper. Res. 302(1), 62\u201378 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.dam.2023.10.018","volume":"343","author":"M Goerigk","year":"2024","unstructured":"Goerigk, M., Lendl, S., Wulf, L.: On the complexity of robust multi-stage problems with discrete recourse. Discret. Appl. Math. 343, 355\u2013370 (2024)","journal-title":"Discret. Appl. Math."},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Gr\u00fcne, C.: The complexity classes of hamming distance recoverable robust problems. In: LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Part I, pp. 321\u2013335","DOI":"10.1007\/978-3-031-55598-5_21"},{"key":"19_CR20","unstructured":"Gr\u00fcne, C., Wulf, L.: On the complexity of recoverable robust optimization in the polynomial hierarchy. CoRR abs\/2411.18590 (2024)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Hunt, K., Zhuang, J.: A review of attacker-defender games: current state and paths forward. Eur. J. Oper. Res. (2023)","DOI":"10.1016\/j.ejor.2023.04.009"},{"issue":"2","key":"19_CR22","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)","journal-title":"Math. Program."},{"key":"19_CR23","unstructured":"Johannes, B.: New classes of complete problems for the second level of the polynomial hierarchy (2011)"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Kasperski, A., Zielinski, P.: Robust two-stage network problems. In: Operations Research Proceedings 2015, Selected Papers of the International Conference of the German, Austrian and Swiss OR Societies, pp. 35\u201340","DOI":"10.1007\/978-3-319-42902-1_5"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Kasperski, A., Zieli\u0144ski, P.: Robust discrete optimization under discrete and interval uncertainty: a survey. Robustness analysis in decision aiding, optimization, and analytics, pp. 113\u2013143 (2016)","DOI":"10.1007\/978-3-319-33121-8_6"},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2017.08.014","volume":"233","author":"A Kasperski","year":"2017","unstructured":"Kasperski, A., Zielinski, P.: Robust recoverable and two-stage selection problems. Discret. Appl. Math. 233, 52\u201364 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"19_CR27","first-page":"125","volume":"22","author":"T Li","year":"2017","unstructured":"Li, T., Sethi, S.P.: A review of dynamic stackelberg game models. Discret. Contin. Dyn. Syst.-B 22(1), 125 (2017)","journal-title":"Discret. Contin. Dyn. Syst.-B"},{"issue":"1","key":"19_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0020-0190(93)90247-7","volume":"45","author":"K Lin","year":"1993","unstructured":"Lin, K., Chern, M.: The most vital edges in the minimum spanning tree problem. Inf. Process. Lett. 45(1), 25\u201331 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"19_CR29","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0167-6377(89)90065-5","volume":"8","author":"K Malik","year":"1989","unstructured":"Malik, K., Mittal, A.K., Gupta, S.K.: The k most vital arcs in the shortest path problem. Oper. Res. Lett. 8(4), 223\u2013227 (1989)","journal-title":"Oper. Res. Lett."},{"key":"19_CR30","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jcss.2022.02.004","volume":"127","author":"A Nabli","year":"2022","unstructured":"Nabli, A., Carvalho, M., Hosteins, P.: Complexity of the multilevel critical node problem. J. Comput. Syst. Sci. 127, 122\u2013145 (2022)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"19_CR31","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1002\/net.21556","volume":"64","author":"FM Pajouh","year":"2014","unstructured":"Pajouh, F.M., Boginski, V., Pasiliao, E.L.: Minimum vertex blocker clique problem. Networks 64(1), 48\u201364 (2014)","journal-title":"Networks"},{"issue":"3","key":"19_CR32","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01530952","volume":"10","author":"V Rutenburg","year":"1993","unstructured":"Rutenburg, V.: Propositional truth maintenance systems: classification and complexity analysis. Ann. Math. Artif. Intell. 10(3), 207\u2013232 (1993)","journal-title":"Ann. Math. Artif. Intell."},{"key":"19_CR33","unstructured":"Schaefer, M., Umans, C.: Completeness in the polynomial-time hierarchy a compendium (2008)"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Smith, J.C., Prince, M., Geunes, J.: Modern network interdiction problems and algorithms. In: Handbook of Combinatorial Optimization, pp. 1949\u20131987. Springer, New York (2013)","DOI":"10.1007\/978-1-4419-7997-1_61"},{"issue":"1","key":"19_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"LJ Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 1\u201322 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR36","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10288-021-00477-y","volume":"19","author":"GJ Woeginger","year":"2021","unstructured":"Woeginger, G.J.: The trouble with the second quantifier. 4OR 19(2), 157\u2013181 (2021). https:\/\/doi.org\/10.1007\/s10288-021-00477-y","journal-title":"4OR"},{"issue":"2","key":"19_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"R Wood","year":"1993","unstructured":"Wood, R.: Deterministic network interdiction. Math. Comput. Model. 17(2), 1\u201318 (1993)","journal-title":"Math. Comput. Model."},{"issue":"15","key":"19_CR38","doi-asserted-by":"publisher","first-page":"1676","DOI":"10.1016\/j.dam.2010.06.006","volume":"158","author":"R Zenklusen","year":"2010","unstructured":"Zenklusen, R.: Matching interdiction. Discret. Appl. Math. 158(15), 1676\u20131690 (2010)","journal-title":"Discret. Appl. Math."}],"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-031-93112-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T10:53:40Z","timestamp":1760007220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-93112-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031931116","9783031931123"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-93112-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"4 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Baltimore, MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco25.cs.jhu.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}