Sciweavers

8 search results - page 1 / 2
» New formulations and valid inequalities for a bilevel pricin...
Sort
View
ORL
2008
111views more  ORL 2008»
13 years 5 months ago
New formulations and valid inequalities for a bilevel pricing problem
Consider the problem of maximizing the toll revenue collected on a multi-commodity transportation network. This fits a bilevel framework where a leader sets tolls, while users res...
Sophie Dewez, Martine Labbé, Patrice Marcot...
ATMOS
2010
308views Optimization» more  ATMOS 2010»
13 years 4 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
IOR
2006
173views more  IOR 2006»
13 years 5 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
EOR
2008
105views more  EOR 2008»
13 years 4 months ago
The multi-item capacitated lot-sizing problem with setup times and shortage costs
We address a multi-item capacitated lot-sizing problem with setup times and shortage costs that arises in real-world production planning problems. Demand cannot be backlogged, but...
Nabil Absi, Safia Kedad-Sidhoum
NETWORKS
2007
13 years 4 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...