Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem. - Jean-François Bérubé; Jean-Yves Potvin; Jean G. Vaucher (Comput. Oper. Res., 2006)

An exact epsilon-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits. - Jean-François Bérubé; Michel Gendreau; Jean-Yves Potvin (Eur. J. Oper. Res., 2009)

A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem. - Jean-François Bérubé; Michel Gendreau; Jean-Yves Potvin (Networks, 2009)