Bilevel programming is a rich paradigm to express a variety of real-world applications including game theoretic and pricing ones. However, what we are interested in this talk is to discuss the bilevel nature of two of the most crucial ingredients of enumerative methods for solving combinatorial optimization problems, namely branching and cutting.
On Bilevel Programming and Its Impact in Branching, Cutting and Complexity / A. Lodi. - STAMPA. - 6697:(2011), pp. 3-3. (Intervento presentato al convegno Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2011 tenutosi a Berlin, Germany nel May 23-27, 2011) [10.1007/978-3-642-21311-3_3].
On Bilevel Programming and Its Impact in Branching, Cutting and Complexity
LODI, ANDREA
2011
Abstract
Bilevel programming is a rich paradigm to express a variety of real-world applications including game theoretic and pricing ones. However, what we are interested in this talk is to discuss the bilevel nature of two of the most crucial ingredients of enumerative methods for solving combinatorial optimization problems, namely branching and cutting.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
