In this paper, we study the aircraft loading problem (ALP) which consists of transporting a series of items between two different points by aircraft at a mi...

In this paper, we survey applications and algorithms pertaining to an important class of price setting problems formulated in the framework of bilevel progr...

The set of equilibrium points of a bimatrix game is the union of polytopes that are not necessarily disjoint. Knowledge of the vertices of these polytopes ...

We consider a bilevel programming formulation of a freight tariff setting problem where the leader consists in one among a group of competing carriers and t...

We consider the problem of determining a set of optimal tolls on the arcs of a multicommodity transportation network. The problem is formulated as a bilevel...

We pursue the study of concavity cuts for the disjoint bilinear programming problem. This optimization problem has two equivalent symmetric linear maxmin r...

We present a branch and cut algorithm that yields in finite time, a globally <img src="epsilon.gif" align=bottom>-optimal (with respect to feasibility and o...

We present branch and bound algorithms that enumerate in finite time all Nash equilibria for strategic and sequence form bimatrix games. For each forms, th...

An FMS environment requires a flexible and adaptable material handling system. Automated guided vehicles (AGV) provide such a system. One of the component...

This paper describes a decision support system based on a sophisticated mixed integer linear programming model, EUGENE, developed to help the regional decis...

The disjoint bilinear programming problem can be reformulated using two distinct linear maxmin programming problems. There is a simple bijection between the...

This paper presents a sophisticated mixed integer linear programming model developed to help the regional decision makers in the long-term planning of the s...

We present a general methodology to study the electricity market of a country or region, under various pricing mechanisms. The approach is based on modifica...

We consider a bilevel model where the leader wants to maximize revenues from a taxation scheme, while the follower rationnally reacts to those tax levels. W...

The maxmin problem models a game sequentially played by two players having opposite objective. Before making his move, the first player must anticipate the...

We study links between the bilevel linear and linear mixed 0-1 programming problems. A new reformulation of the linear mixed 0-1 programming problem into a...

We propose a new exact algorithm for the convex-quadratic bilevel programming problem, i.e, for problems with convex objective function and convex constrain...

The linear Bilevel Programming Problem (BLP) is an instance of a linear hierarchical decision process where the lower level constraint set is dependent on d...

We present a method to compute valid concavity cuts for the linear maxmin programming problem. We consider a primal and a dual approach. In both cases the p...

Several technologies and renewable energy forms are evaluated using the global energy model MARKAL. This report describes some advantages of such an approa...