#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2000

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Luce Brotcorne, Gilbert Laporte, Frédéric Semet
- European Journal of Operational Research
- 2003

This article traces the evolution of ambulance location and relocation models proposed over the past 30 years. The models are classified in two main categories. Deterministic models are used at the planning stage and ignore stochastic considerations regarding the availability of ambulances. Probabilistic models reflect the fact that ambulances operate as… (More)

- Luce Brotcorne, Gilbert Laporte, Frédéric Semet
- Computers & OR
- 2002

We propose fast heuristics for large-scale covering-location problems in which the set of demand points is discrete and the set of potential location sites is continuous. These heuristics are compared on a set of 152 real-life instances arising in cytological screening. 2002 Elsevier Science Ltd. All rights reserved.

- Luce Brotcorne, Saïd Hanafi, Raïd Mansi
- Oper. Res. Lett.
- 2009

- Luce Brotcorne, Martine Labbé, Patrice Marcotte, Gilles Savard
- Transportation Science
- 2001

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 mathematical program where the upper level consists in a firm that raises revenues from tolls set on arcs of the network, while the lower level is represented by a group of users travelling on shortest… (More)

- Luce Brotcorne, Martine Labbé, Patrice Marcotte, Gilles Savard
- Transportation Science
- 2000

- Luce Brotcorne, F. Cirinei, Patrice Marcotte, Gilles Savard
- Discrete Optimization
- 2011

- Luce Brotcorne, Saïd Hanafi, Raïd Mansi
- Discrete Optimization
- 2013

In this paper, we consider the Bilevel Knapsack Problem (BKP), which is a hierarchical optimization problem inwhich the feasible set is determined by the set of optimal solutions for a parametric Knapsack Problem. We introduce a new reformulation of the BKP into a one-level integer programming problem using dynamic programming. We propose an algorithm that… (More)

We consider the problem of jointly determining installed capacity levels and associated tariffs on the arcs of a multicommodity transportation network. We model this situation as a joint pricing and network capacity setting problem. Capacities are available at discrete, non uniform levels. This problem is first formulated as a mixed integer bilevel program.… (More)

The growing traffic congestion in urban areas creates an urgent need for a better transportation planning. In this context, traffic assignment models can be used to help public authorities to test the impact of various transportation policies such as enlarging areas where bottleneck occurs, work start time flexbility etc. The representation of traffic… (More)

- Luce Brotcorne, Martine Labbé, Patrice Marcotte, Gilles Savard
- Operations Research
- 2008

In order to optimize revenue, service firms must integrate within their pricing policies the rational reaction of customers to their price schedules. In the airline or telecommunication industry, this process is all the more complex due to interactions resulting from the structure of the supply network. In this paper we consider a streamlined version of… (More)