Jean-François Bérubé Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2009
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)

Coauthor Index

1Michel Gendreau
[j3] [j2]
2Jean-Yves Potvin
[j3] [j2] [j1]
3Jean G. Vaucher
[j1]
Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Sat May 25 17:06:59 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page