Bilevel optimization is a field of mathematical programming in which some variables are
constrained to be the solution of another optimization problem. As a consequence, bilevel …

Bilevel optimization problems are hierarchical optimization problems where the feasible
region of the so-called upper level problem is restricted by the graph of the solution set …

Bilevel optimization problems are very challenging optimization models arising in many
important practical contexts, including pricing mechanisms in the energy sector, airline and …

In this paper, we describe a comprehensive algorithmic framework for solving mixed integer
bilevel linear optimization problems (MIBLPs) using a generalized branch-and-cut …

Abstract We study the Knapsack Problem with Conflicts, a generalization of the Knapsack
Problem in which a set of conflicts specifies pairs of items which cannot be simultaneously …

Bilevel optimization problems are hierarchical optimization problems where the feasible
region of the so-called upper level problem is restricted by the graph of the solution set …

Two-person interdiction games represent an important modeling concept for applications in
marketing, defending critical infrastructure, stopping nuclear weapons projects, or …

We address a generic mixed-integer bilevel linear program (MIBLP), ie, a bilevel
optimization problem where all objective functions and constraints are linear, and some/all …

We propose an extended variant of the reformulation and decomposition algorithm for
solving a special class of mixed-integer bilevel linear programs (MIBLPs) where continuous …

Robust optimization provides a mathematical framework for modeling and solving decision-
making problems under worst-case uncertainty. This work addresses two-stage robust …