#### Filter Results:

#### Publication Year

1995

2006

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Olivier du Merle, Daniel Villeneuve, Jacques Desrosiers, Pierre Hansen
- Discrete Mathematics
- 1999

MDVSP k k p p k k p K k p k p k ip K k p k p k p k k k ip k k p k j ij i i ij i i p K k x K k n x N i x a x c K k n N i p a p c K k K N j i t d s t A j i A K N j i j i d N i s N i t N K k k k min depot at vehicles of number available : otherwise 0 ; task covers path if 1 path of cost : depot to and from paths of set : , for , if) , (arcs; of set : , for ,… (More)

- Stefan Irnich, Daniel Villeneuve
- INFORMS Journal on Computing
- 2006

- Daniel Villeneuve, Guy Desaulniers
- European Journal of Operational Research
- 2005

- Michel Gamache, François Soumis, Daniel Villeneuve, Jacques Desrosiers, Éric Gélinas
- Transportation Science
- 1998

- Issmail Elhallaoui, Daniel Villeneuve, François Soumis, Guy Desaulniers
- Operations Research
- 2005

Column generation is often used to solve problems involving set-partitioning constraints, such as vehicle-routing and crew-scheduling problems. When these constraints are in large numbers and the columns have on average more than 8–12 nonzero elements, column generation often becomes inefficient because solving the master problem requires very long solution… (More)

- Irina Ioachim, Jacques Desrosiers, Yvan Dumas, Marius M. Solomon, Daniel Villeneuve
- Transportation Science
- 1995

- Daniel Villeneuve, Jacques Desrosiers, Marco E. Lübbecke, François Soumis
- Annals OR
- 2005

Column generation has become a powerful tool in solving large scale integer programs. We argue that most of the often reported compatibility issues between pricing oracle and branching rules disappear when branching decisions are based on the reduction of the variables of the oracle's domain. This can be generalized to branching on variables of a so-called… (More)

- Guy Desaulniers, Daniel Villeneuve
- Transportation Science
- 2000

The problem considered involves finding the minimum cost path, with cost and time being two independent quantities that govern the shortest path. In this problem, each arc is associated with a cost of traversing the arc as well as the time required to traverse it and each node is associated with a lower bound and an upper bound on the time of departure from… (More)

- DANIEL VILLENEUVE, JACQUES DESROSIERS, +4 authors François Soumis
- 2003

Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues between pricing subproblem and branching rule disappear when branching decisions are based on imposing constraints on the sub-problem's variables. This can be generalized to branching on variables of a… (More)