![]() | ![]() |
| 2009 | ||
|---|---|---|
| 3 | Jean-François Bérubé, Michel Gendreau, Jean-Yves Potvin: An exact epsilon-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits. European Journal of Operational Research 194(1): 39-50 (2009) | |
| 2 | Jean-François Bérubé, Michel Gendreau, Jean-Yves Potvin: A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem. Networks 54(1): 56-67 (2009) | |
| 2006 | ||
| 1 | Jean-François Bérubé, Jean-Yves Potvin, Jean G. Vaucher: Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem. Computers & OR 33: 1838-1856 (2006) | |
| 1 | Michel Gendreau | [2] [3] |
| 2 | Jean-Yves Potvin | [1] [2] [3] |
| 3 | Jean G. Vaucher | [1] |
Data released under the ODC-BY 1.0 license — See also our legal information page