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.
A. Lodi (2011). On Bilevel Programming and Its Impact in Branching, Cutting and Complexity [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.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
