Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/286842 
Year of Publication: 
2021
Citation: 
[Journal:] 4OR [ISSN:] 1614-2411 [Volume:] 19 [Issue:] 2 [Publisher:] Springer [Place:] Berlin, Heidelberg [Year:] 2021 [Pages:] 157-181
Publisher: 
Springer, Berlin, Heidelberg
Abstract: 
We survey optimization problems that allow natural simple formulations with one existential and one universal quantifier. We summarize the theoretical background from computational complexity theory, and we present a multitude of illustrating examples. We discuss the connections to robust optimization and to bilevel optimization, and we explain the reasons why the operational research community should be interested in the theoretical aspects of this area.
Subjects: 
Combinatorial optimization
Complexity theory
Polynomial hierarchy
Bilevel optimization
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.