The trouble with the second quantifier
4OR, vol. 19, pp. 157–181
Abstract
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.
Authors 1
-
Affiliation as printed
Department of Computer Science, RWTH Aachen, Aachen, Germany
Cited by 27 stored of 27
No patents citing this paper on Lens.org (checked 2026-10-06).