{"id":"https://openalex.org/W4411188173","doi":"https://doi.org/10.1007/978-3-031-93112-3_19","title":"Completeness in\u00a0the\u00a0Polynomial Hierarchy for\u00a0Many Natural Problems in\u00a0Bilevel and\u00a0Robust Optimization","display_name":"Completeness in\u00a0the\u00a0Polynomial Hierarchy for\u00a0Many Natural Problems in\u00a0Bilevel and\u00a0Robust Optimization","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4411188173","doi":"https://doi.org/10.1007/978-3-031-93112-3_19"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-93112-3_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-93112-3_19","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056202601","display_name":"Christoph Gr\u00fcne","orcid":"https://orcid.org/0000-0002-7789-8870"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christoph Gr\u00fcne","raw_affiliation_strings":["Department of Computer Science, RWTH Aachen University, Aachen, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7789-8870","affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062230321","display_name":"Lasse Wulf","orcid":"https://orcid.org/0000-0001-7139-4092"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lasse Wulf","raw_affiliation_strings":["Section of Algorithms, Logic, and Graphs, Technical University of Denmark, Kongens Lyngby, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-7139-4092","affiliations":[{"raw_affiliation_string":"Section of Algorithms, Logic, and Graphs, Technical University of Denmark, Kongens Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056202601"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":9.0967,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.9804085,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"256","last_page":"269"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bilevel-optimization","display_name":"Bilevel optimization","score":0.738865077495575},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.7304748296737671},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7203246355056763},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6172051429748535},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4621058404445648},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.41247236728668213},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41229766607284546},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3580890893936157},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3555954694747925},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3541123867034912},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.29712149500846863},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1969435214996338}],"concepts":[{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.738865077495575},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7304748296737671},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7203246355056763},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6172051429748535},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4621058404445648},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.41247236728668213},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41229766607284546},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3580890893936157},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3555954694747925},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3541123867034912},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29712149500846863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1969435214996338},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-031-93112-3_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-93112-3_19","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:publications.rwth-aachen.de:1018369","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/1018369","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Integer programming and combinatorial optimization : 26th international conference, IPCO 2025, Baltimore, MD, USA, June 11-13, 2025 : proceedings / Nicole Megow, Amitabh Basu, editors<br/>26. Conference on Integer Programming and Combinatorial Optimization, IPCO 2025, Baltimore, MD, USA, 2025-06-11 - 2025-06-13","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1988871016","https://openalex.org/W2008959214","https://openalex.org/W2023858465","https://openalex.org/W2044825393","https://openalex.org/W2046432398","https://openalex.org/W2065163895","https://openalex.org/W2065251436","https://openalex.org/W2068827145","https://openalex.org/W2074130324","https://openalex.org/W2094834697","https://openalex.org/W2117858572","https://openalex.org/W2133494553","https://openalex.org/W2162275416","https://openalex.org/W2181288515","https://openalex.org/W2229536649","https://openalex.org/W2482469685","https://openalex.org/W2582184501","https://openalex.org/W2594250775","https://openalex.org/W2915069302","https://openalex.org/W2963875387","https://openalex.org/W3024720357","https://openalex.org/W3153827225","https://openalex.org/W3156469768","https://openalex.org/W3159886842","https://openalex.org/W4212857798","https://openalex.org/W4225357686","https://openalex.org/W4245095675","https://openalex.org/W4251616545","https://openalex.org/W4285593816","https://openalex.org/W4365447587","https://openalex.org/W4388580578","https://openalex.org/W4392453784"],"related_works":["https://openalex.org/W4388962799","https://openalex.org/W2041517264","https://openalex.org/W4294789866","https://openalex.org/W1522180487","https://openalex.org/W1969386550","https://openalex.org/W2982557863","https://openalex.org/W2590361123","https://openalex.org/W1575303034","https://openalex.org/W2057722348","https://openalex.org/W4230341406"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}