bernard gendron - Département d`informatique et de recherche

BERNARD GENDRON
CURRICULUM VITÆ
Education
• Ph.D., Computer Science (specialization: Operations Research), Université de Montréal, 01/1991–11/1994.
• M.Sc., Computer Science (specialization: Operations Research), Université de Montréal, 09/1988–12/1990.
• B.Sc., Mathematics, Université de Montréal, 09/1985–05/1988.
Academic and Research Positions
• Full Professor, Département d’informatique et de recherche opérationnelle, Université de Montréal, 06/2006–...
• Associate Professor, Département d’informatique et de recherche opérationnelle,
Université de Montréal, 06/2001–05/2006.
• Principal Scientist, ILOG inc., Paris, 01/2003-08/2003.
• Visiting Professor, Dipartimento di informatica, Universita di Pisa, 05/2003, 06/2005.
• Visiting Professor, Département d’informatique, Université de Versailles-St-Quentinen-Yvelines, 12/2001, 03/2003.
• Assistant Professor, Département d’informatique et de recherche opérationnelle,
Université de Montréal, 11/1996–05/2001.
• Visiting Professor, Département de mathématiques, École polytechnique fédérale
de Lausanne, 05/2001.
• Visiting Professor, Laboratoire d’automatique et de mécanique industrielles et humaines, Université de Valenciennes et du Hainaut-Cambrésis, 06/2000.
• Visiting Scientist, Operations Research Center, Massachusetts Institute of Technology, 11/1995–11/1996.
• Research Associate, Centre de recherche sur les transports, Université de Montréal,
11/1994–11/1995.
• Visiting Scholar, Operations Research Center, Massachusetts Institute of Technology, 01/1994–06/1994.
1
Awards and Honors
• Service Award, Canadian Operational Research Society, 05/2006.
• Finalist, Daniel H. Wagner Award, The Practice Section of INFORMS, (“Scheduling Employees in Quebec’s Liquor Stores with Integer Programming”), 10/2004.
• First prize, Canadian Operational Research Society Practice Prize, (“Scheduling
Employees in Quebec’s Liquor Stores with Integer Programming”), 05/2004.
• First prize, INFORMS Transportation Science Section Dissertation Competition,
(best doctoral thesis in transportation science, academic year 1994-95), 11/1995.
• First prize, Canadian Operational Research Society National Graduate Student
Paper Competition, (“Parallel Implementations of a Branch-and-Bound Algorithm
for Multicommodity Location with Balancing Requirements”), 06/1992.
• Merit Award, Association québécoise du transport et des routes, 05/1991.
Research Grants
• “Combinatorial Optimization, Network Design and Scheduling”, NSERC (Canada)–
Discovery, $36,000/year, 2005–2009, individual grant.
• “Réseau québécois de calcul haute performance (RQCHP)”, NSERC (Canada)–
Major Facilities Access, $240,000/year, 2005–2007, team grant (collaborateur).
• “High Performance Computing Cluster”, NSERC (Canada)–Equipment, $50,951,
2004–2005, team grant (collaborator).
• “Méthodes d’optimisation combinatoire pour la résolution de problèmes de conception de réseaux”, Fonds de recherche sur la nature et les technologies (Québec),
$50,250/year, 2002–2005, team grant (supervisor).
• “‘Models and Methods for Network Design Problems”, NSERC (Canada)–Research,
$26,406/year, 2000–2004, individual grant.
• “Network for Computing and Mathematical Modeling”, NSERC (Canada)–Research
Networks, $3,162,817, 1997–2002, team grant (collaborator).
• “Optimisation combinatoire appliquée à des problèmes de planification de grande
taille”, FCAR (Québec)–Team, $30,000/year, 1999–2002, team grant (supervisor).
• “Confection automatique d’horaires dans le établissements de santé”, NSERC–
Collaborative Health Research Projects, $90,500/year, 1999–2002, team grant (collaborator).
2
• “Upgrade of Parallel Computing Environment”, NSERC (Canada)–Equipment,
$83,118, 2001–2002, team grant (collaborator).
• “Planification et confection d’horaires en milieu hospitalier”, NSERC (Canada)–
Research Networks (RCM2), $50,000, team grant (collaborator).
• “Conception optimale de réseaux avec applications au transport et aux télécommunications”, FCAR (Québec)–Young researcher, $14,600/year, 1998–2001, individual
grant.
• “Software for High Performance Parallel Optimization”, NSERC (Canada)-Equipment,
$56,342, 2000–2001, team grant (collaborator).
• “SUN Enterprise–450 Server”, FCAR (Québec)–Equipment B, $75,000, 1999–2000,
team grant (collaborator).
• “Update of Cluster of Workstations for Parallel Computing”, NSERC (Canada)–
Equipment, $48,656, 1999–2000, team grant (collaborator).
• “Mise à jour des ordinateurs du Laboratoire d’optimisation et de simulation”,
NSERC (Canada)–Equipment, $35,474, 1999–2000, team grant (collaborator).
• “Models and Methods for Network Design Problems”, NSERC (Canada)–Research,
$97,865, 1996–2000, individual grant.
• “Modèles et méthodes d’optimisation combinatoire appliqués à des problèmes de
planification de grande taille”, FCAR (Québec)–Young researcher (team), 1996–
1999, $30,000/year, team grant (collaborator).
• “CPU and Memory Modules for a Distributed Parallel Computer”, NSERC (Canada)–Equipment, $57,600, 1998–1999, team grant (collaborator).
• Université de Montréal, Startup funds, $10,000, 1998–1999, individual grant.
• “UltraSparc Distributed Parallel Computer”, NSERC (Canada)–Equipment, $50,754,
1997–1998, team grant (collaborator).
• “Modèles et méthodes d’optimisation combinatoire appliqués à des problèmes de
planification de grande taille”, FCAR (Québec)–Young researcher (equipment),
$30,000, 1996–1997, team grant (collaborator).
• “Models and Methods for Network Design Problems”, NSERC (Canada)–Research
(equipment), $23,111, 1996–1997, individual grant.
Scholarships
• Département d’informatique et de recherche opérationnelle, Université de Montréal,
11/1995–11/1996 (visit to the Massachussetts Institute of Technology).
3
• Centre de recherche sur les transports, Université de Montréal, 01/1994–10/1994.
• FCAR (Québec), Programme d’action concertée de soutien à la coopération scientifique internationale (visit to the Massachusetts Institute of Technology), 01/1994–
06/1994.
• Université de Montréal, 09/1993–12/1993.
• FCAR–Ministère des transports (Québec), 05/1992–12/1993.
• NSERC (Canada), 09/1991–08/1993.
• Canadian Transportation Research Forum, 09/1991–04/1992.
• Faculté des études supérieures, Université de Montréal, 01/1991–04/1991.
• NSERC (Canada), 09/1990–08/1991.
• Département d’informatique et de recherche opérationnalle, Université de Montréal,
09/1990–12/1990.
• FCAR (Québec), 05/1990–08/1990.
• Département d’informatique et de recherche opérationnalle, Université de Montréal,
09/1989–04/1990.
Professional Activities
Associations
• Member of the judging committee, Award of Merit, Canadian Operational Research
Society, 2006.
• Member of the judging committee, Practice Prize, Canadian Operational Research
Society, 2006.
• President, Canadian Operational Research Society, 2004–2005.
• President, INFORMS Section on Transportation Science & Logistics, 2002–2003.
• Vice-President, Canadian Operational Research Society, 2003–2004.
• Council member, Canadian Operations Research Society, 2002–...
• President, INFORMS Transportation Science Section, 2001–2002.
• President, Montreal Local Section, Canadian Operational Research Society, 2001–
...
4
• Member of the judging committee, Student Paper Competition, Canadian Operational Research Society, 2001.
• Vice-President, INFORMS Transportation Science Section, 2000–2001.
• Secretary-Treasurer, INFORMS Transportation Science Section, 1998–2000.
Journals
• Editor-in-Chief, INFOR, 2006–...
• Associate Editor, Constraint Programming Letters, 2006–...
• Associate Editor, INFOR, 2004–2006.
• Refereeing for Annals of Operations Research (8), Computational Optimization
and Applications (3), Computers and Industrial Engineering (1), Computers and
Operations Research (6), Discrete Applied Mathematics (2), European Journal of
Operational Research (2), Health Care Management Science (1), IEEE Transactions on Parallel and Distributed Systems (1), IIE Transactions (1), INFOR (3),
INFORMS Journal on Computing (5), Information Processing Letters (1), International Journal of Mathematical Algorithms (1), International Transactions in
Operational Research (3), Journal of Heuristics (4), Journal of Parallel and Distributed Computation (1), Management Science (1), Mathematical Programming
(1), Naval Research Logistics (1), Networks (4), Operations Research (5), Parallel Computing (1), RAIRO (1), Ricerca Operativa (1), Transportation Research E
(1), Transportation Science (11), Telecommunication Systems (2), The Computer
Journal (1).
Conferences
• Member of the program committee, CP-AI-OR 2007 (International Conference on
Integration of AI and OR Techniques in Constraint Programming for Combinatorial
Optimization Problems), Brussels, Belgium, May 23–26 2007.
• Member of the program committee, CP-AI-OR 2006 (International Conference on
Integration of AI and OR Techniques in Constraint Programming for Combinatorial
Optimization Problems), Cork, Ireland, May 30–June 2 2006.
• Coorganizer (with J.-F. Cordeau and V. Verter), CORS/Optimization Days Joint
Conference, Montréal, Canada, May 8–10 2006.
• Member of the program committee, CP-AI-OR 2005 (International Conference on
Integration of AI and OR Techniques in Constraint Programming for Combinatorial
Optimization Problems), Prague, Czech Republic, May 30–June 1 2005.
• Member of the program committee, INOC 2005 (International Network Optimization Conference), Lisbon, Portugal, March 20–23 2005.
5
• Coorganizer (with J.-F. Cordeau), Journées de l’optimisation/Optimization Days,
Montréal, May 10–12 2004.
• Member of the program committee, CP-AI-OR 2004 (International Conference on
Integration of AI and OR Techniques in Constraint Programming for Combinatorial
Optimization Problems), Nice, France, April 20–22 2004.
• Member of the program committee, Fifth International Workshop on Integration of
AI and OR Techniques in Constraint Programming for Combinatorial Optimization
Problems, Montréal, Canada, May 8–10 2003.
• Member of the organizing committee, Workshop on Parallel Branch-and-Bound,
Versailles, France, January 27–28 2003.
• Coorganizer (with J.-F. Cordeau), Journées de l’optimisation/Optimization Days,
Montréal, May 6–8 2002.
• Coorganizer (with B. Jaumard), Comment les techniques d’optimisation peuvent
améliorer la gestion dans le domaine de la santé, Montréal, November 16 2001.
• Organizer of the session “Multicommodity Capacitated Fixed-Charge Network Design”, SCRO/Journées de l’optimisation–CORS/Optimization Days, Québec, May
6–9 2001.
• Organizer of the session “Network Design”, Journées de l’optimisation/Optimization Days, May 10–12 1999.
• Organizer of the Transportation Science Section Cluster, INFORMS/CORS meeting, Montréal, April 26–29 1998.
• Organizer of the session “Multimodal, Multicommodity Transportation Systems”,
INFORMS/CORS meeting, Montréal, April 26–29, 1998.
• Organizer of the session “Network Design”, INFORMS meeting, Dallas, October
26–29 1997.
• Organizer of the session “Network Design”, Journées de l’optimisation/Optimization Days, May 12–14 1997.
• Organizer of the session “Network Design”, Journées de l’optimisation/Optimization Days, May 13–15 1996.
• Member of the organizing committee, Parallel Optimization Colloquium, Versailles,
France, March 25–27 1996.
• Organizer of the session “Parallel Branch-and-Bound”, INFORMS meeting, New
Orleans, October 29–November 1 1995.
Industrial Consulting
6
• Consulting, project “Gestion des assignations du personnel” (optimization software
for personnel scheduling), Socété des alcools du Québec, 03/2000–...
• Instructor, Optimization Suite, ILOG inc., 2001–2003
– Solver 5.0 Training, Defense Research Establishment Valcartier, Canada, March
19–21 2001.
– CPLEX 7.0 Training, ILOG inc., Mountain View, California, U.S.A., 8–9
March 2001.
– CPLEX 8.0 Training, ILOG inc., Arlington, Virginia, U.S.A., August 19–21
2002.
– CPLEX 8.0 Training, ILOG inc., Omaha, Nebraska, U.S.A., October 1–2 2002.
Participation in Grants and Scholarships Committees
• External expert, evaluation of a grant proposal, NSERC (Canada), 2004.
• Committee member, evaluation of Ph.D. scholarships, Fonds de recherche sur la
nature et les technologies (Québec), comité 03C, groupe 1 (Mathématiques, informatique et statistiques), 2004-2005.
• Committee member, evaluation of Ph.D. scholarships, Fonds de recherche sur la
nature et les technologies (Québec), comité 03C, groupe 1 (Mathématiques, informatique et statistiques), 2003-2004.
• Committee member, evaluation of Ph.D. scholarships, Fonds de recherche sur la
nature et les technologies (Québec), comité 03C, groupe 1 (Mathématiques, informatique et statistiques), 2002-2003.
• External expert, evaluation of a grant proposal, NSERC (Canada), 2002.
• External expert, evaluation of a grant proposal, Fonds national suisse de la recherche
scientifique, 2002.
• Committee member, evaluation of Ph.D. scholarships, FCAR (Québec), comité
03C, groupe 1 (Mathématiques, informatique et statistiques), 2001-2002.
Teaching
• “Modèles de recherche opérationnelle–IFT1575”, Winter 2005, Autumn 2006, Winter 2006.
• “Parallel Computing in Combinatorial Optimization”, Universit di Pisa, Summer
2005.
• “Flots dans les réseaux–IFT6542”, Autumn 2004, Autumn 2005, Autumn 2006.
7
• “Techniques d’optimisation 3–IFT6503”, Autumn 2003.
• “Séminaire d’initiation à la recherche (Applications en optimisation de réseaux:
transport et télécommunications)”, Université de Versailles-St-Quentin-en-Yvelines,
Winter 2003.
• “Séminaire d’intégration interdisciplinaire sur les transports (Logistique et distributique)–PLU6000”, Winter 2000.
• “Programmation en nombres entiers–IFT6551”, Winter 1997, Winter 1998, Autumn 1998, Winter 2000, Winter 2001, Winter 2002, Winter 2004.
• “Graphes et réseaux–IFT3540”, Autumn 1998.
• “Structures discrètes en informatique–IFT1063”, Autumn 1997, Winter 1999, Autumn 1999, Autumn 2000, Winter 2001, Autumn 2001, Winter 2002, Autumn 2003.
• “Modèles de recherche opérationnelle–IFT1850”, Autumn 1993.
Supervision
Postdoctoral Students
• Edith Naudin, “Méthodes polyédrales pour la conception des réseaux”, 09/2004–
09/2005 (with T.G. Crainic).
• Djemal Rebaine, “Problèmes de gestion d’horaires de personnel en santé”, 09/2001–
08/2002
Ph.D. Students Supervised
• Claudio Contardo, “Problèmes combinés de localisation et de tournées de véhicules”,
09/2005–... (with J.-F. Cordeau).
• Simon Boivin, “Algorithmes parallèles de programmation par contraintes”, 05/2005–
... (with G. Pesant).
• Patrick St-Louis, “Problèmes de clique maximum et de coloration”, 09/2002–...
(with A. Hertz).
• Eric Springuel (FCAR-FQRNT Scholarship), “Enumération des rayons extrêmes
d’un cône polyédral et applications en minimisation concave”, 01/2000–01/2006
(with P. Soriano).
• Mervat Chouman, “Étude des propriétés polyédrales du problème de conception
de réseaux multiproduits avec coût fixe et capacité”, 01/1997–08/2003 (with T.G.
Crainic).
M.Sc. Students Supervised
8
• Marie-Claude Côté (Département de mathématiques appliquées et génie industriel,
École polytechnique de Montréal), “Algorithmes de filtrage pour des problèmes
d’horaires de personnel”, 09/2005–... (avec L.-M. Rousseau).
• Imen Temimi, “Heuristique basée sur des méthodes de montée duale et de voisinage variable pour la résolution d’un problème de localisation dans un système de
distribution”, 01/2002–08/2005.
• Marc Brisson (Département de génie informatique, École polytechnique de Montréal),
“Recherche locale basée sur les contraintes pour la planification d’horaires de ligues
sportives”, 01/2003–12/2004. (with G. Pesant).
• Jean-Robert Quevillon, “Génération d’horaires de médecins en salle d’urgence avec
une méthode de recherche avec tabous”, 09/2000–08/2004. (with J.A. Ferland).
• Hocine Lebbah (Département de génie informatique, École polytechnique de Montréal),
“Confection d’horaires de médecins en salle d’urgence par une méthode hybride de
programmation par contraintes et de génération de colonnes”, 01/2001–05/2004
(with G. Pesant).
• Mohamad Saadie, “Méthodes de programmation par contraintes pour la confection
d’horaires de médecins en salle d’urgence”, 09/1999–03/2003 (with G. Pesant).
• Dominique Tourillon (NSERC Scolarship, FCAR Transport Scholarship), “Méthodes
de montée duale pour le problème de conception de réseaux multiproduits avec coûts
fixes et capacités”, 09/2000–09/2002
• Patrick St-Louis, “Heuristique d’évaporation de pénalités dans une méthode de
dćomposition pour trouver la plus grande clique d’un graphe”, 09/2000–06/2002
(with J.A. Ferland).
• Francis Forget, “Confection automatisée des horaires de médecins dans une salle
d’urgence”, 09/2000–05/2002 (with J.A. Ferland).
• Ianis Queval, “Développement d’une méthode de recherche avec tabous pour un
problème de chargement de réseaux de télécommunications”, 01/1999–09/2001
(with J.-Y. Potvin and P. Soriano).
• Eric Méthot, “CPar: Implantation et évaluation d’un compilateur pour une variante
parallèle de C”, 09/1997–06/2001 (with M. Feeley and T.G. Crainic).
• Geneviève Hernu, “Heuristiques basées sur la programmation mathématique pour le
problème de conception de réseaux avec coûts fixes et capacités”, 01/1999–01/2001
(with T.G. Crainic).
• Huguette Beaulieu, “Planification de l’horaire des médecins dans une salle d’urgence”,
09/1995–06/1998 (with J.A. Ferland).
9
• Benoı̂t Bourbeau, “Stratégies de parallélisation basées sur l’organisation de la
mémoire pour des algorithmes de séparations et évaluations progressives”, 09/1994–
01/1998 (with T.G. Crainic).
Engineering and D.E.A. Students Supervised
• Thomas Feron (Université de Versailles St-Quentin-en-Yvelines, France), “Parallélisation d’un algorithme de Branch-and-Cut pour un problème de conception
de réseaux avec coûts fixes et capacités”, 03/2003–09/2003.
• Thierry Authié (Université Paul Sabatier Toulouse 3, France), “Contributions à la
résolution d’un problème de conception de réseaux”, 06/2003–09/2003.
• Ludovic Calès (Université Blaise-Pascal, France), “Résolution d’un problème de
conception de réseaux par la méthode de Branch-and-Price-and-Cut”, 02/2000–
09/2000 (with J.-Y. Potvin and P. Soriano).
• Stéphanie Petit (Institut National des Sciences Appliquées de Toulouse, France),
“Programmation par contraintes appliquée au problème de la confection des horaires de médecins d’urgence”, 02/1999–09/1999 (with G. Pesant and P. Soriano).
• Cécile Houel (Université Blaise-Pascal, France), “Résolution d’un problème de
conception de réseaux par la méthode de Branch-and-Price-and-Cut”, 02/1999–
09/1999 (with J.-Y. Potvin and P. Soriano).
• Marc Chardon (Université Blaise-Pascal, France), “Résolution d’un problème de
conception de réseaux à l’aide de méthodes de recherche à voisinages variables”,
02/1999–09/1999 (with J.-Y. Potvin and P. Soriano).
• Karine Deschinkel (Université Blaise-Pascal, France), “Recherche avec tabous et
génération de colonnes pour un problème de conception de réseaux”, 02/1998–
09/1998 (with J.-Y. Potvin and P. Soriano).
• Sébastien Mena (Université Blaise-Pascal, France), “Résolution d’un problème de
conception de réseaux par la méthode de Branch-and-Price”, 02/1998–09/1998
(with J.-Y. Potvin and P. Soriano).
• Marie Ménochet (Université Blaise-Pascal, France), “Résolution d’un problème de
conception de réseau multiproduit à l’aide d’une recherche avec tabous”, 02/1998–
09/1998 (with T.G. Crainic).
• David Berger (Université Blaise-Pascal, France), “Résolution d’un problème de
conception de réseaux à l’aide d’une recherche avec tabous”, 02/1997–09/1997 (with
J.-Y. Potvin and P. Soriano).
• Pierre Jardinier (Université Blaise-Pascal, France), “Implantation parallèle orientée
objet des méthodes de séparation et évaluation progressive avec application aux
problèmes de conception de réseaux”, 02/1997–09/1997 (with T.G. Crainic).
10
• Christelle Rusque (Université Blaise-Pascal, France), “Résolution d’un problème
de localisation avec équilibrage à l’aide d’une méthode de recherche avec tabous”,
02/1997–09/1997 (with J.-Y. Potvin and P. Soriano).
Undergraduate Students Supervised
• Terence Jacyno, “Horaires de médecins d’urgence”, Winter 2000 (with J.A. Ferland).
• Francis Forget, “Horaires de médecins d’urgence”, Summer 1999 (with J.A. Ferland).
• Ronald Raphaël, “Horaires de médecins d’urgence”, Summer 1999 (IFT3051).
• Patrick Saint-Louis, “Programmation orientée objet et méthodes heuristiques”,
Summer 1999 (with J.A. Ferland), Winter 2000 (IFT3051).
• Ianis Queval, “Méthodes de relaxation entropique pour problèmes d’optimisation
de réseaux avec coûts fixes”, Summer 1998.
• Julie Roy, “Conception de réseaux et Branch-and-Bound”, Summer 1998 (with
T.G. Crainic and M. Gendreau).
• Dominique Tourillon, “Conception de réseaux”, Summer 1998 (with T.G. Crainic),
Summer 1999.
• Benoı̂t Delorme, “Méthodes de relaxation entropique pour problèmes d’optimisation
de réseaux avec coûts fixes”, Summer 1997, Autumn 1997 (IFT3051).
• Liette Lefebvre, “Interfaces pour les horaires de médecins”, Winter 1997 (IFT3051).
• Jamal Khalfaoui, “Problèmes de localisation avec équilibrage”, Summer 1996, Winter 1997 (IFT3051), Summer 1997.
Ph.D. Thesis Committees
• Eric Springuel, DIRO, “Enumération des rayons extrêmes d’un cône polyédral et
applications en minimisation concave”, 2006 (supervisor).
• Jawad Abrache, “Modèles et algorithmes pour les enchères combinatoires”, 2003
(committee member).
• Ilfat Ghamlouche, “Métaheuristiques pour le problème de synthèse de réseau multiproduits avec capacités”, 2003 (committee member).
• Mervat Chouman, “Étude des propriétés polyédrales du problème de conception de
réseaux multiproduits avec coût fixe et capacité”, 2003 (co-supervisor).
• Noureddine Chabini, “Méthodes pour améliorer la qualité des implantations matérielles
de systèmes informatiques”, 2001 (committee member).
11
• Michael Mahut, “A Discrete Flow Model for Dynamic Network Loading”, 2000
(committee member).
M.Sc. Thesis Committees
• Roxane Kouassi, DIRO, “Heuristiques pour l’expansion multi-périodes de la capacité dans un rśeau local de télécommunications”, 2006 (committee member).
• Alexandre Bouffard, DIRO, “Métaheuristique pour la minimisation des coûts de
protection par segment dans les réseaux optiques WDM”, 2005 (president).
• Imen Temimi, “Heuristique basée sur des méthodes de montée duale et de voisinage variable pour la résolution d’un problème de localisation dans un système de
distribution”, 2005 (supervisor).
• Marc Brisson (Département de génie informatique, École polytechnique de Montréal),
“Recherche locale basée sur les contraintes pour la planification d’horaires de ligues
sportives” 2004 (co-supervisor).
• Jean-Robert Quevillon, “Génération d’horaires de médecins en salle d’urgence avec
une méthode de recherche avec tabous”, 2004 (supervisor).
• Hocine Lebbah (Département de génie informatique, École polytechnique de Montréal),
“Confection d’horaires de médecins en salle d’urgence par une méthode hybride de
programmation par contraintes et de génération de colonnes”, 2004 (co-supervisor).
• Philippe Thibault, “Modélisation tridimensionnelle des ARN par exploration de
l’espace conformationnel et satisfaction de contraintes”, 2004 (president).
• Raha Pooyania, “Routing impact on the dimensioning of the 3G multi-service networks”, 2004 (committee member).
• Nikolaj Van Omme, “Le problème du postier chinois cumulatif”, 2003 (committee
member).
• Jean-Nicolas Pépin, “Calcul parallèle des plus courts chemins temporels”, 2003
(committee member).
• Ali Smires, “Expansion multi-périodes d’un réseau local de télécommunications”,
2003 (committee member).
• Dominique Tourillon, “Méthodes de montée duale pour le problème de conception
de réseaux multiproduits avec coûts fixes et capacités”, 2002 (supervisor).
• Patrick St-Louis, “Heuristique d’évaporation de pénalités dans une méthode de
dćomposition pour trouver la plus grande clique d’un graphe”, 2002 (co-supervisor).
• Francis Forget, “Confection automatisée d’horaire de médecins en salle d’urgence”,
2002 (supervisor).
12
• Catherine Beaulieu, “Méthodes heuristiques pour résoudre un problème d’horaires
de projets avec contraintes sur les ressources”, 2002 (committee member).
• Houjing Huang, “Recherche de structures secondaires dans les séquences biologiques”,
2001 (president).
• Ianis Queval, “Développement d’une méthode de recherche avec tabous pour un
problème de chargement de réseaux de télécommunications”, 2001 (supervisor).
• Julie Roy, “Étendre le contexte d’application de CrewOpt”, 2001 (committee member).
• Sylvie Roussel,“Planification de l’exploitation forestière par méthodes heuristiques”,
2001 (president).
• Geneviève Hernu, “Heuristiques basées sur la programmation mathématique pour le
problème de conception de réseaux avec coûts fixes et capacités”, 2001 (supervisor).
• Pascal Labit (Département de génie électrique et de génie informatique, École polytechnique de Montréal), “Un algorithme de plus courts chemins avec contraintes de
ressources pour la fabrication automatique d’horaires”, 2000 (external examiner).
• Eric Méthot, “CPar: Implantation et évaluation d’un compilateur pour une variante
parallèle de C”, 2000 (committee member).
• Amina Benterki, “Modélisation des effets réseaux dans le transport des matières
dangereuses”, 2000 (committee member).
• Patrick Gendron, “Détection et analyse de motifs structuraux et fonctionnels dans
les acides ribonucléiques”, 2000 (committee member).
• Jocelyn Demers, “Une librarie orientée-objet pour la simulation des réseaux stochastiques dynamiques”, 1999 (committee member).
• Eduardo Morais Guimaraes, “Heuristiques pour le problème d’ordonnancement de
tâches sur plusieurs machines parallèles avec objectif minimax”, 1999 (committee
member).
• Jawad Abrache, “Mise au point et implantation d’algorithmes pour l’allocation
déterministe de conteneurs vides”, 1998 (president).
• Huguette Beaulieu, “Planification de l’horaire des médecins dans une salle d’urgence”,
1998 (supervisor).
• Karl Tanguay, “Implantation d’un algorithme bicritère d’affectation de trafic”, 1998
(president).
• Nicolas Tremblay, “Le calcul des plus courts chemins statiques et temporels: synthèse, implantations séquentielles et parallèles”, 1998 (president).
13
• Benoı̂t Bourbeau, “Stratégies de parallélisation basées sur l’organisation de la
mémoire pour des algorithmes de séparations et évaluations progressives”, 1998
(co-supervisor).
• Imène Nabli, “Horaires du personnel infirmier avec approches heuristiques”, 1995
(committee member).
Ph.D. Exam Committees
• Endong Zhu, “Time-Dependent Network Design with Application in Freight Rail
Transportation” 2006 (committee member).
• Daniel De Ladurantaye, “Application de la recherche opérationnelle à des problèmes
industriels”, 2005 (president).
• Benoı̂t Vignac, “Problèmes d’optimisation de réseaux de télécommunications”, 2005
(president).
• Bouazza Elbenani, “Le problème de tournées des intervenants pour les tournées à
domicile”, 2004 (committee member).
• Amina Lamghari, “Affectation des juges lors des compétitions”, 2004 (president).
• Walter Rei, “Programmation stochastique en nombres entiers”, 2004 (committee
member).
• Patrick St-Louis, “Nouveaux algorithmes, bornes et formulations pour les problèmes
de la clique maximum et de la coloration minimum”, 2004 (supervisor).
• Mariam Tagmouti, “Gestion de flotte et tournées de véhicules en viabilité hivernale”, 2003 (committee member).
• Eric Springuel, “Métaheuristiques et minimisation de fonctions non-convexes sur
un domaine polyédral”, 2002 (supervisor).
• Louis-Martin Rousseau, “Programmation par contraintes et problèmes de tournées
de véhicules”, 2001 (president).
• Eric Paquette, “Simulation des effets de déterioration de surfaces rigides pour un
rendu réaliste”, 2000 (committee member).
• Maroun Kassab, “Vérification statique des aspects temporels des circuits logiques
synchrones”, 1999 (committee member).
• Mervat Chouman, “Etude des propriétés polyédrales pour le problème de conception de réseaux multiproduits avec capacités”, 1998 (co-supervisor).
• Ilfat Ghamlouche, “Méthodes de recherche avec tabous pour le problème de conception de réseaux multiproduits avec capacités”, 1998 (president).
14
• Christiane Lemieux, “L’amélioration de l’efficacité des estimateurs en simulation”,
1997 (committee member).
• Jose Rubio-Ardanaz, “Méthodes d’affectation dynamique du trafic”, 1997 (president).
• Soumia Ichoua, “Méthodes de recherche heuristiques pour des problèmes dynamiques de répartition de véhicules”, 1997 (committee member).
Other Committees
• External examiner, M.Sc. Thesis, Karine Dufresne, Département de mathématiques
appliquées et de génie industriel, École polytechnique de Montréal, “Transformations de graphes et nombre de stabilité”, 2005.
• External examiner, Ph.D. Thesis, Mauricio Cardoso de Souza, Université de ClermontFerrand, “Modèles continus et algorithmes de résolution pour les problèmes de
routage et d’expansion de capacités des réseaux de communications”, 2002.
• Committee member, mémoire d’habilitation à diriger des recherches en informatique, Thierry Mautor, Université de Versailles Saint-Quentin-en-Yvelines, France,
“Méta-heuristiques et méthodes exactes pour les problèmes d’optimisation combinatoire difficiles : illustration sur le problème d’affectation quadratique”, 2001.
• External examiner, M.Sc. Thesis, Pascal Labit, Département de génie électrique
et de génie informatique, École polytechnique de Montréal, “Un algorithme de
plus courts chemins avec contraintes de ressources pour la fabrication automatique
d’horaires”, 2000.
Research Analysts
• Geneviève Hernu, Centre de recherche sur les transports, Université de Montréal,
01/2001–...
• François Guertin, Centre de recherche sur les transports, Université de Montréal,
01/2001–...
• Serge Bisaillon, Centre de recherche sur les transports, Université de Montréal,
12/1996–...
• Benoı̂t Bourbeau, Centre de recherche sur les transports, Université de Montréal,
09/1997–02/1998.
Research Contributions
Books and Book Chapters
15
1. Gendron B., Semet F., Strozyk C., “Adaptive Distribution Systems”, TRANSTECH:
Transport Technology Product & Process Innovation Management, Presses Universitaires de Valenciennes, 36-42, 2002.
2. Gendron B., Crainic T.G., Frangioni A., “Multicommodity Capacitated Network
Design”, chapter 1 in Telecommunications Network Planning, Soriano P. and Sanso
B. editors, Kluwer Academics Publisher, 1-19, 1998.
Articles Published in Refereed Journals
3. Croxton K.L., Gendron B., Magnanti T.L., “Variable Disaggregation in Network
Flow Problems with Piecewise Linear Costs”, forthcoming Operations Research.
4. Gendron B., “Scheduling Employees in Quebec’s Liquor Stores with Integer Programming”, Interfaces 35, 402-410, 2005.
5. Crainic T.G., Gendron B., Hernu G., “A Slope Scaling/Lagrangean Perutrbation
Heuristic with Long-Term Memory for Multicommodity Fixed-Charge Network Design”, Journal of Heuristics, 10, 525-545, 2004.
6. Persson J.A., Göthe-Lundgren M., Lundgren J.T., Gendron B., “A Tabu Search
Heuristic for Scheduling the Production Processes at an Oil Refinery”, International
Journal of Production Research 42, 445-471, 2004.
7. Gendron B., Potvin J.-Y., Soriano P., “A Tabu Search with Slope Scaling for the
Multicommodity Capacitated Location with Balancing Requirements”, Annals of
Operations Research 122, 193-217, 2003.
8. Croxton K.L., Gendron B., Magnanti T.L., “A Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems”,
Management Science 49, 1268-1273, 2003.
9. Gendron B., Potvin J.-Y., Soriano P., “A Parallel Hybrid Heuristic for the Multicommodity Capacitated Location Problem with Balancing Requirements”, Parallel
Computing 29, 591-606, 2003.
10. Chouman M., Crainic T.G., Gendron B., “Revue des inégalités valides pertinentes
aux problèmes de conception de réseaux”, INFOR 41, 5-33, 2003.
11. Croxton K.L., Gendron B., Magnanti T.L., “Models and Methods for Merge-inTransit Operations”, Transportation Science 37, 1-22, 2003.
12. Gendron B., Potvin J.-Y., Soriano P., “Diversification Strategies in Local Search
for a Nonbifurcated Network Loading Problem”, European Journal of Operational
Research 142, 231-241, 2002.
13. Gendron B., “A Note on “A Dual-Ascent Approach to the Fixed-Charge Capacitated Network Design Problem””, European Journal of Operational Research 138,
671-675, 2002.
16
14. Crainic T.G., Frangioni A., Gendron B., “Bundle-Based Relaxation Methods for
Multicommodity Capacitated Fixed Charge Network Design Problems”, Discrete
Applied Mathematics 112, 73-99, 2001.
15. Berger D., Gendron B., Potvin J.-Y., Raghavan S., Soriano P., “Tabu Search for a
Network Loading Problem with Multiple Facilities”, Journal of Heuristics 6, 253267, 2000.
16. Beaulieu H., Ferland J.A., Gendron B., Michelon P., “A Mathematical Programming Approach for Scheduling Physicians in the Emergency Room”, Health Care
Management Science 3, 193-200, 2000.
17. Bourbeau B., Crainic T.G., Gendron B., “Branch-and-Bound Parallelization Strategies Applied to a Depot Location and Container Fleet Management Problem”,
Parallel Computing 26, 27-46, 2000.
18. Gendron B., Potvin J.-Y., Soriano P., “Tabu Search with Exact Neighbor Evaluation for Multicommodity Location with Balancing Requirements”, INFOR 37,
255-270, 1999.
19. Gendron B., Crainic T.G.,“A Parallel Branch-and-Bound Algorithm for Multicommodity Location with Balancing Requirements”, Computers and Operations Research 24, 829-847, 1997.
20. Gendron B., Crainic T.G., “A Branch-and-Bound Algorithm for Depot Location
and Container Fleet Management”, Location Science 3, 39-53, 1995.
21. Gendron B., Crainic T.G., “Parallel Branch-and-Bound Algorithms: Survey and
Synthesis”, Operations Research 42, 1042-1066, 1994.
22. Gendron B., Crainic T.G., “Parallel Implementations of a Branch-and-Bound Algorithm for Multicommodity Location with Balancing Requirements”, INFOR 31,
151-165, 1993.
Articles Submitted to Refereed Journals
23. Gendron B., Semet F., “Formulations and Relaxations for a Multi-Echelon Capacitated Location-Distribution Problem”, Computers and Operations Research.
24. Gendron B., Hertz A., St-Louis P., “On Edge-Orienting Methods in Graph Coloring”, Journal of Combinatorial Optimization.
25. Springuel E., Gendron B., Soriano P., “Degeneracy and Enumeration in Basic Concave Programming”, Journal of Global Optimization.
26. de Souza M.C., Mahey P., Gendron B., “Cycle-Based Algorithms for Multicommodity Flow Problems with Piecewise Convex Separable Costs”, Networks.
17
27. Chouman M., Crainic T.G., Gendron B., “A Cutting-Plane Algorithm Based on
Cutset Inequalities for Multicommodity Capacitated Fixed Charge Network Design”, Networks.
28. St-Louis P., Ferland J.A., Gendron B., “A Penalty-Evaporation Heuristic in a Decomposition Method for the Maximum Clique Problem”, INFORMS Journal on
Computing.
Articles Published in Refereed Conference Proceedings
29. Gendron B., Lebbah H., Pesant G., “Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation”, Proceedings of CPAIOR 2005, Lecture Notes in Computer Science, 3524,
217-227, Prague, République Tchèque, May 29–June 1, 2005.
30. Frangioni A., Gendron B., “0-1 Reformulations of the Network Loading Problem”,
Proceedings of INOC 2005, B1.38-B1.43, Lisbon, Portugal, March 20–23, 2005.
31. de Souza M.C., Gendron B., “Exploring Local Optima in Piecewise Convex Multicommodity Flow Problems”, Proceedings of INOC 2005, 360-365, Lisbon, Portugal,
March 20–23, 2005.
32. Méthot E., Feeley M., Gendron B., “Cpar: A Parallel Language for Divide and
Conquer Parallelism”, Proceedings of the 2000 International Conference on Communications in Computing, 255-258, CIC’2000, Las Vegas, Nevada, USA, June
26–29, 2000.
33. Chabini I., Gendron B., “Parallel Performance Measures Revisited”, High Performance Computing Symposium’95, 381-392, Canada’s Ninth Annual High Performance Computing Symposium and Exhibition, Montréal, Canada, July 10–12
1995.
Non-Refereed Contributions
Articles Published in Non-Refereed Journals
34. Gendron B., “Sobering Thought: Can IP Solve Liquor Store Scheduling Woes?”,
ORMS Today, 32(2), 24-30, April 2005.
Theses
35. Gendron B., “Nouvelles méthodes de résolution de problèmes de conception de
réseaux et leur implantation en environnement parallèle”, Ph.D. thesis, Département d’informatique et de recherche opérationnelle, Université de Montréal, 1994
(publication CRT-94-50, Centre de recherche sur les transports, Université de Montréal, 1994).
36. Gendron B., “Implantations parallèles d’un algorithme de séparation et évaluation progressive pour résoudre le problème de localisation avec équilibrage”, M.Sc.
18
thesis, Département d’informatique et de recherche opérationnelle, Université de
Montréal, 1991 (publication CRT-761, Centre de recherche sur les transports, Université de Montréal, 1991).
Technical Reports
37. Gendron B., Potvin J.-Y., Soriano P., “Variable Neighborhood Descent for Multicommodity Location with Balancing Requirements”, publication CRT-99-46, Centre de recherche sur les transports, Université de Montréal, 1999.
38. Beaulieu H., Ferland J.A., Gendron B., Lefebvre L., “A Computer System Based
on Optimization for Scheduling Physicians in the Emergency Room”, publication
#1127, Département d’informatique et de recherche opérationnelle, Université de
Montréal, 1998.
39. Gendron B., Crainic T.G., “Bounding Procedures for Multicommodity Capacitated
Fixed Charge Network Design Problems”, publication CRT-96-06 (appeared previously as CRT-95-12), Centre de recherche sur les transports, Université de Montréal,
1996.
40. Gendron B., Crainic T.G., “Parallel Implementations of Bounding Procedures for
Multicommodity Capacitated Network Design Problems”, publication CRT-94-45,
Centre de recherche sur les transports, Université de Montréal, 1994.
41. Gendron B., Crainic T.G., “Relaxations for Multicommodity Capacitated Network
Design Problems”, publication CRT-965, Centre de recherche sur les transports,
Université de Montréal, 1994.
42. Gendron B., “Modèles et algorithmes pour problèmes de planification de réseaux
et de localisation”, publication CRT-882, Centre de recherche sur les transports,
Université de Montréal, 1992.
43. Gendron B., Crainic T.G., “An Exact Algorithm for Multicommodity Location
with Balancing Requirements”, publication CRT-843, Centre de recherche sur les
transports, Université de Montréal, 1992.
Presentations in Conferences with Selection Committee
44. Gendron B., Semet F., Temimi I., “A Combined Dual Ascent/Variable Neighborhood Heuristic for a Multi-Echelon Location-Distribution Problem”, ISOLDE X International Symposium on Locational Decisions, Sevilla, Spain, June 2–8 2005.
45. Chouman M., Crainic T.G., Gendron B., “A Lagrangian-Based Branch-and-Cut
Algorithm for Multicommodity Capacitated Fixed-Charge Network Design”, TRISTAN V - Triennial Symposium on Transportation Analysis, Le Gosier, Guadeloupe,
June 12–18 2004.
19
46. Chouman M., Crainic T.G., Gendron B., “Valid Inequalities for Multicommodity
Capacitated Fixed Charge Network Design”, TRISTAN IV - Triennial Symposium
on Transportation Analysis, São Miguel, Portugal, June 13–19 2001.
47. Gendron B., Semet F., Strozyk C., “The Vehicle Routing Problem with Simultaneous Pickup and Delivery”, TRISTAN IV - Triennial Symposium on Transportation
Analysis, São Miguel, Portugal, June 13–19 2001.
48. Potvin J.-Y., Gendron B., Soriano P., “Variable Neighborhood Descent for Multicommodity Location with Balancing Requirements”, Metaheuristics International
Conference - MIC 99, Angra dos Reis, Brazil, July 19–23 1999.
49. Croxton K.L., Gendron B., Magnanti T.L., “Models and Methods for Merge-inTransit Operations”, TRISTAN III - Triennial Symposium on Transportation Analysis, San Juan, Porto Rico, June 17–23 1998.
50. Crainic T.G., Frangioni A., Gendron B. (1998), “Relaxation Methods for Multicommodity Capacitated Network Design”, TRISTAN III - Triennial Symposium
on Transportation Analysis, San Juan, Porto Rico, June 17–23 1998.
51. Crainic T.G., Frangioni A., Gendron B., “Relaxation Methods for Multicommodity
Capacitated Network Design”, Symposium on Combinatorial Optimization, Bruxelles, Belgium, April 15–17 1998.
52. Crainic T.G., Bourbeau B., Frangioni A., Gendron B., “Parallel Branch-and-Bound
for Multicommodity Capacitated Network Design”, APMOD98: Applied Mathematical Programming and Modeling, Limassol, Cyprus, March 11–13 1998.
53. Gendron B., Crainic T.G., Frangioni A., “Multicommodity Capacitated Network
Design”, Telecommunications Network Planning, Montréal, Canada, December 4–5
1996.
54. Chabini I., Gendron B., “An Entropy-Based Branch-and-Bound Algorithm for
Fixed Charge Transportation Problems”, Symposium on Combinatorial Optimization, London, England, March 27–29 1996.
55. Bourbeau B., Crainic T.G., Gendron B., “Parallel Branch-and-Bound Algorithms
for Large-Scale Network Design Problems”, Symposium on Combinatorial Optimization, London, England, March 27–29 1996.
56. Bourbeau B., Crainic T.G., Gendron B., “Parallel Branch-and-Bound Algorithms
for Large-Scale Network Design Problems”, Parallel Optimization Colloquium, Versailles, France, March 25–27 1996.
57. Gendron B., Crainic T.G., Gendreau M., Potvin J.-Y., Laporte G., “Parallel Solution Methods for Some Transportation Planning Problems Formulated as Integer
and Mixed-Integer Programs”, Fifth INFORMS Computer Science Technical Section’s Conference, Dallas, Texas, U.S.A., January 7–10 1996.
20
58. Le Saux E., Chabini I., Florian M., Gendron B., “Computer Representations of
Networks for ITS Applications”, Fifth INFORMS Computer Science Technical Section’s Conference, Dallas, Texas, U.S.A., January 7–10 1996.
59. Crainic T.G., Gendreau M., Gendron B., “Solution Approaches for Multicommodity Capacitated Fixed Charge Network Design Problems”, Third ORSA Telecommunications Conference, Boca Raton, Florida, U.S.A., March 20–22 1995.
60. Gendron B., Crainic T.G., “Parallel Implementations of Bounding Procedures for
Multicommodity Capacitated Network Design”, TRISTAN II - Triennial Symposium on Transportation Analysis, Capri, Italy, June 23–28 1994.
61. Gendron B., Crainic T.G., “A Parallel Branch-and-Bound Algorithm for Multicommodity Uncapacitated Location with Balancing Requirements”, Fourth ORSA
Computer Science Technical Section’s Conference, Williamsburgh, Virginia, U.S.A.,
January 5–7 1994.
62. Gendron B., Crainic T.G., “Relaxations for Multicommodity Capacitated Network
Design Problems”, NETFLOW93, San Miniato, Italy, October 3–7 1993.
Other Conference Presentations
63. Gendron B., Semet F., “Formulations, Bounds and Heuristic Methods for a MultiEchelon Location-Distribution Problem”, NOW 2006 - Network Optimization Workshop, St-Rémy de Provence, France, August 22–25 2006.
64. Chouman M., Crainic T.G., Gendron B., Naudin E., “Exact Methods for Multicommodity Capacitated Fixed-Charge Network Design”, Odysseus 2006, The Third
International Workshop on Freight Transportation and Logistics, Altea, Spain, May
23–26 2006.
65. Gendron B., Ferland J.A., Quevillon J.-R., “Assignment-Based Tabu Search for
Scheduling Physicians in an Emergency Room”, CORS, Halifax, Canada, May 16–
18 2005 (invited talk).
66. St-Louis P., Gendron B., Hertz A., “Edge-Reversal and Bichromatic Exchanges to
Color a Graph”, Journées de l’optimisation/Optimization Days, Montréal, Canada,
May 9–11 2005 (invited talk).
67. Chouman M., Crainic T.G., Gendron B., Naudin E., “Cutset-Based Cutting-Plane
Algorithm for Multicommodity Capacitated Fixed-Charge Network Design”, Journées
de l’optimisation/Optimization Days, Montréal, Canada, May 9–11 2005 (invited
talk).
68. Gendron B., Crainic T.G., Frangioni A., Guertin F., “OOBB: Object-Oriented
Tools for Parallel Branch-and-Bound”, PAREO 2005, Mont-Tremblant, Canada,
January 16–21 2005 (invited talk).
21
69. Gendron B., Potvin J.-Y., Soriano P., “A Branch-and-Price-and-Cut Algorithm
for Multifacility Nonbifurcated Network Loading”, INFORMS, Denver, Colorado,
U.S.A., October 24–27 2004 (invited talk).
70. Gendron B., “Scheduling Employees in Quebec’s Liquor Stores with Integer Programming”, INFORMS, Denver, Colorado, U.S.A., October 24–27 2004 (invited
talk; finalist, Daniel H. Wagner Award).
71. Gendron B., “Scheduling Employees in Quebec’s Liquor Stores with Integer Programming”, CORS/INFORMS Joint International Meeting, Banff, Canada, May
16–19 2004 (invited talk; winner of the CORS Practice Prize).
72. Gendron B., Ferland J.A., Forget F., Quevillon J.-R., “Assignment Models for
Scheduling Physicians in an Emergency Room”, CORS/INFORMS Joint International Meeting, Banff, Canada, May 16–19 2004 (invited talk).
73. Pesant G., Brisson M., Gendron B., “Using the Traveling Tournament Problem
to Study a Constraint-Based Local Search Approach”, CORS/INFORMS Joint
International Meeting, Banff, Canada, May 16–19 2004 (invited talk).
74. Chouman M., Crainic T.G., Gendron B., “A Lagrangian-Based Branch-and-Cut Algorithm for Multicommodity Capacitated Fixed-Charge Network Design”, CORS/INFORMS Joint International Meeting, Banff, Canada, May 16–19 2004 (invited
talk).
75. Croxton K.L., Gendron B., Magnanti T.L., “Variable Disaggregation in Network
Flow Problems with Piecewise Linear Costs”, CORS/INFORMS Joint International
Meeting, Banff, Canada, May 16–19 2004 (invited talk).
76. Gendron B., Potvin J.-Y., Soriano P., “A Branch-and-Price-and-Cut Algorithm for
Multifacility Nonbifurcated Network Loading”, CORS/INFORMS Joint International Meeting, Banff, Canada, May 16–19 2004 (invited talk).
77. Gendron B., Potvin J.-Y., Soriano P., “A Parallel Hybrid Heuristic for Multicommodity Capacitated Location with Balancing Requirements”, CORS/INFORMS
Joint International Meeting, Banff, Canada, May 16–19 2004 (invited talk).
78. Gendron B., Potvin J.-Y., Soriano P., “A Branch-and-Price-and-Cut Algorithm for
Multifacility Nonbifurcated Network Loading”, Journées de l’optimisation/Optimization Days, Montréal, Canada, May 10–12 2004 (invited talk).
79. Costa A., Cordeau J.-F., Gendron B., “Benders Decomposition for Multicommodity
Capacitated Fixed-Charge Network Design”, Journées de l’optimisation/Optimization Days, Montréal, Canada, May 10–12 2004 (invited talk).
80. Chouman M., Crainic T.G., Gendron B., “A Lagrangian-Based Branch-and-Cut Algorithm for Multicommodity Capacitated Fixed-Charge Network Design”, Journées
22
de l’optimisation/Optimization Days, Montréal, Canada, May 10–12 2004 (invited
talk).
81. Lebbah H., Gendron B., Pesant G., “Confection d’horaires de médecins par une
méthode hybride de génération de colonnes et de programmation par contraintes”,
Journées de l’optimisation/Optimization Days, Montréal, Canada, May 10–12 2004
(invited talk).
82. Gendron B., Potvin J.-Y., Soriano P., “A Parallel Hybrid Heuristic for Multicommodity Capacitated Location with Balancing Requirements”, Journées de l’optimisation/Optimization Days, Montréal, Canada, May 10–12 2004 (invited talk).
83. Brisson M., Pesant G., Gendron B., “Hybridation de la programmation par contraintes et de la recherche locale appliquée au Traveling Tournament Problem”,
Journées de l’optimisation/Optimization Days, Montréal, Canada, May 10–12 2004
(invited talk).
84. Frangioni A., Gendron B., “Binary Versus Integer Formulations for Multicommodity Capacitated Network Design”, Journées de l’optimisation/Optimization Days,
Montréal, Canada, May 10–12 2004 (invited talk).
85. Gendron B., “Decomposition Methods for Multicommodity Capacitated Network
Desig n”, Wokshop on Optimization of Optical Networks, Montréal, Canada, March
25–26 20 04 (invited talk).
86. Frangioni A., Gendron B., “Binary Versus Integer Formulations for Multicommodity Capacitated Network Design”, INFORMS, Atlanta, Georgia, U.S.A., October
19–22 2003 (invited talk).
87. Croxton K.L., Gendron B., Magnanti T.L., “Variable Disaggregation in Network
Flow Problems with Piecewise Linear Costs”, INFORMS, Atlanta, Georgia, U.S.A.,
October 19–22 2003 (invited talk).
88. Croxton K.L., Gendron B., Magnanti T.L., “Variable Disaggregation in Network
Flow Problems with Piecewise Linear Costs”, Odysseus 2003, The Second International Workshop on Freight Transportation and Logistics, Palermo, Italy, May
27–30 2003.
89. St-Louis P., Ferland J.A., Gendron B., “A Penalty-Evaporation Heuristic in a Decomposition Method for the Maximum Clique Problem”, Journées de l’optimisation/
Optimization Days, Montréal, Canada, May 5–7 2003 (invited talk).
90. Croxton K.L., Gendron B., Magnanti T.L., “Variable Disaggregation in Network
Flow Problems with Piecewise Linear Costs”, Journées de l’optimisation/Optimization
Days, Montréal, Canada, May 5–7 2003.
23
91. Croxton K.L., Gendron B., Magnanti T.L., “Variable Disaggregation in Network
Flow Problems with Piecewise Linear Costs”, ROADEF 2003, Avignon, France,
February 26–28 2003.
92. Gendron B., Crainic T.G., Frangioni A., Guertin F., “Object-Oriented Tools for
Easy Development of Parallel Branch-and-Bound”, Workshop on Parallel Branchand-Bound, Versailles, France, January 27–28 2003 (invited talk).
93. Gendron B., “Decomposition Methods for Multicommodity Capacitated Network
Design”, IMA-CRT-CRM Workshop on Location and Vehicle Routing, Montréal,
December 2–6 2002 (invited talk).
94. Chouman M., Crainic T.G., Gendron B., “Branch-and-Cut Algorithm for Multicommodity Capacitated Fixe-Charge Network Design Problem”, INFORMS, San
Jose, California, U.S.A., November 17–20 2002 (invited talk).
95. Gendron B., Crainic T.G., Frangioni A., Guertin F., “Object-Oriented Tools for
Easy Development of Parallel Branch-and-Bound”, INFORMS, San Jose, California, U.S.A., November 17–20 2002 (invited talk).
96. Tourillon D., Gendron B., “Dual-Ascent Decomposition for Multicommodity Capacitated Network Design”, CORS, Toronto, Canada, June 3–5 2002 (invited talk).
97. St-Louis P., Ferland J.A., Gendron B., “A Penalty-Evaporation Heuristic in a Decomposition Method for the Maximum Clique Problem”, CORS, Toronto, Canada,
June 3–5 2002 (invited talk).
98. Jaumard B., Gendron B., Rebaine D., “Assigning Nurses from the Availability List
According to Seniority and Shift Length”, CORS, Toronto, Canada, June 3–5 2002
(invited talk).
99. Gendron B., Potvin J.-Y., Queval I., Soriano P., “A Tabu Search Algorithm for a
Network Loading Problem with Bifurcated Flows” CORS, Toronto, Canada, June
3–5 2002 (invited talk).
100. Gendron B., Ferland J.A., Forget F., “Integer Programming for Scheduling Physicians in an Emergency Room”, CORS, Toronto, Canada, June 3–5 2002 (invited
talk).
101. Gendron B., Crainic T.G., Hernu G., “A Slope Scaling Heuristic with Lagrangean
Perturbation and Long-Term Memory for the Multicommodity Capacitated FixedCharge Network Design Problem”, CORS, Toronto, Canada, June 3–5 2002 (invited
talk).
102. Gendron B., Potvin J.-Y., Soriano P., “Parallel Hybrid Variable Neighborhood
Descent with Slope Scaling for the Multicommodity Capacitated Location Problem
with Balancing Requirements”, PAREO, Guadeloupe, France, May 20–24 2002.
24
103. Gendron B., Crainic T.G., Frangioni A., Guertin F., “Object-Oriented Tools for
Easy Development of Parallel Branch-and-Bound Algorithms”, PAREO, Guadeloupe, France, May 20–24 2002.
104. Tourillon D., Gendron B., “Dual-Ascent Decomposition for Multicommodity Capacitated Network Design”, Journées de l’optimisation/Optimization Days, Montréal,
Canada, May 6–8 2002 (invited talk).
105. Gendron B., Potvin J.-Y., Soriano P., “Parallel Hybrid Variable Neighborhood
Descent with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements”, Journées de l’optimisation/Optimization Days,
Montréal, Canada, May 6–8 2002 (invited talk).
106. Quévillon J.R., Ferland J.A., Gendron B., “Génération d’horaires de médecins
d’urgence à l’aide de la recherche tabou”, Journées de l’optimisation/Optimization
Days, Montréal, Canada, May 6–8 2002 (invited talk).
107. Gendron B., Ferland J.A., Forget F., “Integer Programming for Scheduling Physicians in an Emergency Room”, Journées de l’optimisation/Optimization Days,
Montréal, Canada, May 6–8 2002 (invited talk).
108. Jaumard B., Gendron B., Rebaine D., “Assigning Nurses from the Availability List
According to Seniority and Shift Length”, Journées de l’optimisation/Optimization
Days, Montréal, Canada, May 6–8 2002 (invited talk).
109. St-Louis P., Ferland J.A., Gendron B., “A Penalty-Evaporation Heuristic in a Decomposition Method for the Maximum Clique Problem”, Journées de l’optimisation/
Optimization Days, Montréal, Canada, May 6–8 2002 (invited talk).
110. Gendron B., Crainic T.G., Frangioni A., Guertin F., “Object-Oriented Tools for
Easy Development of Parallel Branch-and-Bound Algorithms with Applications to
Network Design”, Journées de l’optimisation, Montréal, Canada, May 6–8 2002
(invited talk).
111. Gendron B., Crainic T.G., Hernu G., “A Slope Scaling Heuristic with Lagrangean
Perturbation and Long-Term Memory for the Multicommodity Capacitated FixedCharge Network Design Problem”, Journées de l’optimisation/Optimization Days,
Montréal, Canada, May 6–8 2002 (invited talk).
112. Chouman M., Crainic T.G., Gendron B., “A Branch-and-Cut Algorithm for Multicommodity Capacitated Fixed-Charge Network Design Problems”, Journées de
l’optimisation/Optimization Days, Montréal, Canada, May 6–8 2002 (invited talk).
113. Gendron B., Ferland J., Forget F., “Un système informatique basé sur l’optimisation
pour la confection des horaires de médecins en salle d’urgence”, Comment les techniques d’optimisation peuvent améliorer la gestion dans le domaine de la santé,
Montréal, Canada, November 16 2001 (invited talk).
25
114. Gendron B., Tourillon D., “Dual-Ascent Procedures for Multicommodity Capacitated Fixed-Charge Network Design Problems”, INFORMS, Miami, Florida, U.S.A.,
November 4–7 2001 (invited talk).
115. Gendron B., Ferland J., Forget F., “Integer Programming for Scheduling Physicians
in an Emergency Room”, INFORMS, Miami, Florida, U.S.A., November 4–7 2001
(invited talk).
116. Chouman M., Crainic T.G., Gendron B., “Valid Inequalities for the Multicommodity Capacitated Fixed-Charge Network Design Problem”, INFORMS, Miami,
Florida, U.S.A., November 4–7 2001 (invited talk).
117. Soriano P., Gendron B., Potvin J.-Y., ‘Tabu Search for a Network Loading Problem
with Bifurcated Flows”, INFORMS, Miami, Florida, U.S.A., November 4–7 2001.
118. Soriano P., Gendron B., Potvin J.-Y., Queval I., “Tabu Search for a Netwrok Loading Problem with Bifurcated Flows”, Italian Association for Operational Research
- AIRO 2001, Villasimius, Italy, September 4–7 2001.
119. Chouman M., Crainic T.G., Gendron B., “Étude polyédrale du problème de conception de réseau multiproduit avec coût fixe et capacité”, Francoro III, Québec,
Canada, May 9–12 2001.
120. Gendron B., Crainic T.G., Frangioni A., Guertin F., “Object-Oriented Tools for
Easy Development of Parallel Branch-and-Bound Algorithms”, CORS/Optimization
Days–SCRO/Journées de l’optimisation, Québec, Canada, May 6–9 2001 (invited
talk).
121. Chouman M., Crainic T.G., Gendron B., “Valid Inequalities for the Multicommodity Capacitated Fixed-Charge Network Design Problem”, CORS/Optimization
Days–SCRO/Journées de l’optimisation, Québec, Canada, May 6–9 2001 (invited
talk).
122. Gendron B., Crainic T.G., Hernu G., “A Combined Slope Scaling/Lagrangian
Perturbation Heuristic for Multicommodity Capacitated Fixed-Charge Network
Design”, CORS/Optimization Days–SCRO/Journées de l’optimisation, Québec,
Canada, May 6–9 2001 (invited talk).
123. Gendron B., Hernu G., Crainic T.G., “A Combined Slope Scaling/Lagrangian Perturbation Heuristic for Multicommodity Capacitated Fixed-Charge Network Design”, INFORMS, San Antonio, Texas, U.S.A., November 5–8 2000.
124. Croxton K.L., Gendron B., Magnanti T.L., “Models and Methods for Merge-inTransit Operations”, Odysseus 2000, The First International Workshop on Transportation and Logistics, Chania, Crete, Greece, May 23–26 2000.
26
125. Gendron B., Guertin F., Potvin J.-Y., Soriano P., “A Comparison of Neighborhood
Search Heuristics for a Nonbifurcated Network Loading Problem with Multiple
Facilities” ECCO XIII, European Chapter on Combinatorial Optimization, Capri,
Italy, May 18–20 2000.
126. Gendron B., Potvin J.-Y., Soriano P., “Large-Scale Neighborhood Search Applied
to a Nonbifurcated Network Loading Problem with Multiple Facilities”, INFORMS,
Philadelphia, Pennsylvania, U.S.A., November 6–9 1999 (invited talk).
127. Gendron B., Crainic T.G., Frangioni A., “Dual-Ascent Procedures for Multicommodity Capacitated Fixed-Charge Network Design Problems”, INFORMS, Philadelphia, Pennsylvania, U.S.A., November 6–9 1999 (invited talk).
128. Gendron B., Croxton K.L., Magnanti T.L., “Models and Methods for Merge-inTransit Operations”, IFORS 99, Beijing, China, August 16–20 1999 (invited talk).
129. Gendron B., Croxton K.L., Magnanti T.L., “Modeling and Solving the Merge-inTransit Problem”, Journées de l’optimisation/Optimization Days, Montréal, Canada, May 10–12 1999 (invited talk).
130. Croxton K.L., Magnanti T.L., Gendron B., “Network Problems with Piecewise
Linear Cost Functions”, Journées de l’optimisation/Optimization Days, Montréal,
Canada, May 10–12 1999 (invited talk).
131. Gendron B., Potvin J.-Y., Soriano P., “Tabu Search for a Capacitated Multicommodity Location Problem with Balancing Requirements”, Journées de l’optimisation/
Optimization Days, Montréal, Canada, May 10–12 1999 (invited talk).
132. Soriano P., Gendron B., Potvin J.-Y., “Tabu Search for a Network Loading Problem
with Multiple Facilities”, Journées de l’optimisation/Optimization Days, Montréal,
Canada, May 10–12 1999 (invited talk).
133. Beaulieu H., Ferland J., Gendron B., Lefebvre L., “A Computer System Based
on Optimization for Scheduling Physicians in the Emergency Room”, Journées
de l’optimisation/Optimization Days, Montréal, Canada, May 10–12 1999 (invited
talk).
134. Raghavan S., Gendron B., Potvin J.-Y., Soriano P., Berger D., “Tabu Search for a
Network Loading Problem with Multiple Facilities”, INFORMS, Cincinnati, Ohio,
U.S.A., May 2–5 1999 (invited talk).
135. Gendron B., Potvin J.-Y., Soriano P., “Tabu Search for a Capacitated Multicommodity Location Problem with Balancing Requirements”, INFORMS, Cincinnati,
Ohio, U.S.A., May 2–5 1999 (invited talk).
136. Soriano P., Gendron B., Potvin J.-Y., “Tabu Search for a Network Loading Problem with Multiple Facilities and Bifurcated Flows”, INFORMS, Cincinnati, Ohio,
U.S.A., May 2–5 1999 (invited talk).
27
137. Beaulieu H., Ferland J., Gendron B., Lefebvre L., Michelon P., “Un système informatique basé sur l’optimisation pour la confection des horaires de médecins en
salle d’urgence”, Comment les techniques d’optimisation peuvent améliorer la gestion dans le domaine de la santé, Montréal, Canada, March 19 1999 (invited talk).
138. Croxton K.L., Magnanti T.L., Gendron B., “Modeling Piecewise Linear Multicommodity Flows”, INFORMS, Seattle, Washington, U.S.A., October 25–28 1998.
139. Croxton K.L., Gendron B., Magnanti T.L., “Models and Methods for Merge-inTransit Operations”, INFORMS/CORS, Montréal, Canada, April 26–29 1998 (invited talk).
140. Gendron B., Potvin J.-Y., Soriano P., “Tabu Search for Capacitated Location Problems with Balancing Requirements”, INFORMS/CORS, Montréal, Canada, April
26–29 1998 (invited talk).
141. Crainic T.G., Frangioni A., Gendron B., “A Comparison of Relaxation Methods
for Multicommodity Capacitated Network Design”, INFORMS/CORS, Montréal,
Canada, April 26–29 1998 (invited talk).
142. Gendron B., Berger D., Potvin J.-Y., Raghavan S., Soriano P., “Tabu Search for a
Network Loading Problem with Multiple Facilities”, INFORMS/CORS, Montréal,
Canada, April 26–29 1998 (invited talk).
143. Gendron B., Berger D., Potvin J.-Y., Raghavan S., Soriano P., “Tabu Search for
a Network Loading Problem with Multiple Facilities”, INFORMS, Dallas, Texas,
U.S.A., October 26–29 1997 (invited talk).
144. Gendron B., Bourbeau B., Crainic T.G., Frangioni A., “Parallel Branch-and-Bound
for Multicommodity Capacitated Network Design”, INFORMS, Dallas, Texas, U.S.A.,
October 26–29 1997 (invited talk).
145. Chabini I., Gendron B., “An Entropy-Based Approach to Fixed-Charge Network
Flow Problems”, INFORMS, Dallas, Texas, U.S.A., October 26–29 1997 (invited
talk).
146. Crainic T.G., Gendron B., Gendreau M., “Data for Network Design Problems”,
INFORMS, Dallas, Texas, U.S.A., October 26–29 1997 (invited talk).
147. Beaulieu H., Ferland J.A., Gendron B., Michelon P., “Planification de l’horaire des
médecins dans une salle d’urgence”, 48e colloque des sciences mathématiques du
Québec, Trois-Rivières, Canada, October 17–19 1997.
148. Gendron B., Bourbeau B., Crainic T.G., Frangioni A., “Parallel Branch-and-Bound
for Multicommodity Capacitated Network Design”, 16th International Symposium
on Mathematical Programming, Lausanne, Switzerland, August 24–29 1997 (invited talk).
28
149. Crainic T.G., Bourbeau B., Gendron B., “Strategies for a Parallel Branch-andBound for Multicommodity Uncapacitated Location with Balalncing Requirements”,
EURO/INFORMS 97, Barcelona, Spain, July 14–17 1997 (invited talk).
150. Gendron B., Croxton K.L., Magnanti T.L., “Modeling and Solving the Capacitated Merge-in-Transit Problem”, Journées de l’optimisation/Optimization Days,
Montréal, Canada, May 12–14 1997 (invited talk).
151. Gendron B., Crainic T.G., Frangioni A., “Relaxation Methods for Multicommodity Capacitated Network Design”, Journées de l’optimisation/Optimization Days,
Montréal, Canada, May 12–14 1997 (invited talk).
152. Bourbeau B., Crainic T.G., Gendron B., “A Comparison of Parallel Branch-andBound Strategies with Applications to Network Design”, Journées de l’optimisation/Optimization Days, Montréal, Canada, May 12–14 1997 (invited talk).
153. Chabini I., Gendron B., “An Entropy-Based Approach to Fixed-Charge Network
Problems”, Journées de l’optimisation/Optimization Days, Montréal, Canada, May
12–14 1997 (invited talk).
154. Gendron B., Croxton K.L., Magnanti T.L., “Modeling and Solving the Capacitated
Merge-in-Transit Problem”, INFORMS, San Diego, California, U.S.A., May 4–7
1997 (invited talk).
155. Gendron B., Croxton K.L., Magnanti T.L., “Models for Merge-in-Transit Operations”, INFORMS, Atlanta, Georgia, U.S.A., November 3–6 1996 (invited talk).
156. Crainic T.G., Gendron B., “Service Network Design in Freight Transportation”,
IFORS 96, Vancouver, Canada, July 8–12 1996 (invited talk).
157. Bourbeau B., Crainic T.G., Gendron B., “Parallel Branch-and-Bound Algorithms
for Large-Scale Network Design Problems”, Journées de l’optimisation/Optimization Days, Montréal, Canada, May 13–15 1996 (invited talk).
158. Gendron B., Bourbeau B., Crainic T.G., “An Object-Oriented Library for Parallel
Branch-and-Bound and Applications to the Resolution of Network Design Problems”, INFORMS, New Orleans, Louisiana, U.S.A. October 29 – November 1 1995
(invited talk).
159. Gendron B., Crainic T.G., Gendreau M., “Mixing Tabu Search and Branch-andBound to Solve Network Design Problems”, INFORMS, New Orleans, Louisiana,
U.S.A. October 29 – November 1 1995 (invited talk).
160. Gendron B., Crainic T.G., “Procédures de calcul de bornes pour des problèmes
de conception de réseaux multiproduit avec capacité et leur implantation en environnement parallèle”, Journée du groupe combinatoire de l’AFCET, Issy-lesMoulineaux, France, December 2 1994 (invited talk).
29
161. Gendron B., Crainic T.G., “Toward Efficient Resolution of Large-Scale Multicommodity Capacitated Fixed Charge Network Design Problems”, 15th International
Symposium on Mathematical Programming, Ann Arbor, Michigan, U.S.A., August
15–19 1994.
162. Gendron B., Crainic T.G., “Parallel Implementations of Bounding Procedures for
Multicommodity Capacitated Network Design”, CORS–Optimization Days/SCRO–
Journées de l’optimisation, Montréal, Canada, May 29 – June 1 1994 (invited talk).
163. Gendron B., Crainic T.G., “Parallel Implementations of B&B Algorithms for Location Problems with Balancing Requirements”, TIMS/ORSA, Chicago, Illinois,
U.S.A., May 16–19 1993 (invited talk).
164. Gendron B., Crainic T.G., “Parallel Implementations of B&B Algorithms for Location Problems with Balancing Requirements”, Journées de l’optimisation/Optimization Days, Montréal, Canada, May 12–14 1993 (invited talk).
165. Gendron B., Crainic T.G., “Exact Algorithms for Multicommodity Location with
Balancing Requirements”, CORS/SCRO, Toronto, Canada, June 1–3 1992.
166. Gendron B., Crainic T.G., “Parallel Branch-and-Bound on Quadputers”,
CORS/SCRO, Toronto, Canada, June 1–3 1992 (invited talk).
167. Gendron B., Crainic T.G., “Exact Algorithms for Multicommodity Location with
Balancing Requirements”, Journées de l’optimisation/Optimization Days, Montréal,
Canada, May 4–6 1992 (invited talk).
168. Crainic T.G., Gendron B., “Parallel Branch-and-Bound on Quadputers”,
ORSA/TIMS, Anaheim, California, U.S.A., November 3–6 1991 (invited talk).
169. Gendron B., Crainic T.G., “Parallel Branch-and-Bound on Quadputers”, EURO
XI, Aachen, Germany, July 16–19 1991 (invited talk).
170. Crainic T.G., Gendron B., “Parallel Branch-and-Bound on Quadputers”, Journées
de l’optimisation/Optimization Days, Montréal, Canada, May 8–9 1991 (invited
talk).
171. Gendron B., Crainic T.G., “Parallel Branch-and-Bound for Location-Distribution
Problems with Balancing Requirements”, ORSA/TIMS, Philadelphia, Pennsylvania, U.S.A., October 29–31 1990.
172. Gendron B., Crainic T.G., “Parallel Branch-and-Bound for Location Problems
with Balancing Requirements”, TIMS/ORSA, Las Vegas, Nevada, U.S.A., May
7–9 1990.
173. Gendron B., Crainic T.G., “Applications du parallélisme au problème de localisation avec équilibrage”, Journées de l’optimisation/Optimization Days, Montréal,
Canada, May 3–4 1990 (invited talk).
30
Invited Seminar Presentations
174. Gendron B., “Méthodes exactes (séquentielles et parallèles) pour les problèmes de
design de réseaux”, Colloque conjoint CIRRELT et Chaire de recherche industrielle
du CRSNG en management logistique, Université du Québec à Montréal, September 13 2006.
175. Gendron B., “Recherche au CRT en conception de réseaux et confection d’horaires”,
Journées du CIRRELT, HEC Montréal, April 25–26 2006.
176. Gendron B., “Optimiser la confection d’horaires de personnel”, Séminaire du RROM,
HEC Montréal, April 21 2006.
177. Gendron B., “Combinatorial Optimization Methods for Personnel Scheduling Problems”, Ecole Polytechnique de Tunis, Tunis, Tunisie, June 9 2005.
178. Gendron B., “Decomposition Methods for Capacitated Network Design Problems”,
Ecole Polytechnique de Tunis, Tunis, Tunisie, June 8 2005.
179. Gendron B., “Combinatorial Optimization Methods for Personnel Scheduling Problems”, Industrial Partnership Program Symposium, Brown University, Providence,
Rhode Island, U.S.A., May 3 2005.
180. Gendron B., “Decomposition Methods for Capacitated Network Design Problems”,
Université Laval, Québec, Canada, February 25 2005.
181. Gendron B., “Optimisation des horaires de personnel”, 3ème déjeuner-causerie sur
l’utilisation novatrice de méthodes quantitatives pour aider à la prise de décision
dans les organisations, CIRANO, Montréal, Canada, February 16 2005.
182. Gendron B., “Scheduling Employees in Quebec’s Liquor Stores with Integer Programming”, WindSOR/SWORD 2004, Windsor, Canada, August 30 2004.
183. Croxton K.L., Gendron B., Magnanti T.L., “Variable Disaggregation in Network
Flow Problems with Piecewise Linear Costs”, Department of Computer Science,
University of Pisa, Italy, June 5 2003.
184. Gendron B., “Decomposition Methods for Multicommodity Capacitated Network
Design”, Laboratoire de recherche en informatique, Université Paris Sud, Paris,
May 2 2003.
185. Gendron B., “Decomposition Methods for Multicommodity Capacitated Network
Design”, Bouygues Telecom Recherche, Paris, April 8 2003.
186. Gendron B., “Decomposition Methods for Multicommodity Capacitated Network
Design”, ILOG, Paris, January 30 2003.
31
187. Gendron B., “Méthodes de décomposition pour la résolution de problèmes de conception de réseau avec coûts fixes et capacités”, Laboratoire Prism, Université de
Versailles-Saint-Quentin-en-Yvelines, Versailles, France, December 13 2001.
188. Gendron B., Croxton K.L., Magnanti T.L., “Models and Methods for Mergein-Transit Operations”, LAMIH-ROI, Université de Valenciennes et du HainautCambrésis, France, June 26 2001.
189. Gendron B., Croxton K.L., Magnanti T.L., “Models and Methods for Merge-inTransit Operations”, Département de mathématiques, École polytechnique fédérale
de Lausanne, Switzerland, June 5 2001.
190. Gendron B., “Decomposition Approaches for Multicommodity Capacitated FixedCharge Network Design Problem”, LAMIH-ROI, Université de Valenciennes et du
Hainaut-Cambrésis, France, June 22 2000.
191. Gendron B., “Decomposition Approaches for Multicommodity Capacitated FixedCharge Network Design Problem”, Department of Computer Science, University of
Pisa, Italy, May 29 2000.
192. Gendron B., Croxton K.L., Magnanti T.L., “Models and Methods for Merge-inTransit Operations”, Gansu University of Technology, Lanzhou, China, August 23
1999.
193. Gendron B., “Parallélisation des algorithmes de séparation et évaluation progressive”, Département d’informatique et de recherche opérationnelle, Université de
Montréal, April 7 1998.
194. Croxton K.L., Gendron B., Magnanti T.L., “Models and Methods for Merge-inTransit Operations”, Department of Electrical Engineering, University of Perugia,
Italy, November 19 1997.
195. Croxton K.L., Gendron B., Magnanti T.L., “Models and Methods for Merge-inTransit Operations”, Department of Computer Science, University of Pisa, Italy,
November 17 1997.
196. Gendron B., “Parallel Branch-and-Bound for Network Design”, Department of
Computer Science, University of Copenhagen, Copenhagen, Denmark, October 20
1995.
197. Chabini I., Gendron B., “The Relative Burden: A New Performance Measure of
Parallel Systems”, Department of Mathematics, Linköping Institute of Technology,
Linköping, Sweden, October 17 1995.
198. Gendron B., “Toward Efficient Resolution of Large-Scale Multicommodity Capacitated Network Design Problems”, Department of Mathematics, Linköping Institute
of Technology, Linköping, Sweden, October 16 1995.
32
199. Chabini I., Gendron B., “The Relative Burden: A New Performance Measure of
Parallel Systems”, Laboratoire Prism, Université de Versailles-Saint-Quentin-enYvelines, Versailles, France, October 13 1995.
200. Gendron B., “Parallel Branch-and-Bound for Network Design”, Laboratoire Prism,
Université de Versailles-Saint-Quentin-en-Yvelines, Versailles, France, October 11
1995.
201. Gendron B., “Résolution de problèmes de conception de réseaux”, Département
d’informatique et de recherche opérationnelle, Université de Montréal, Montréal,
Canada, March 20 1995 (seminar of candidature for a position of Assistant Professor).
202. Gendron B., “Nouvelles méthodes de résolution de problèmes de conception de
réseaux et leur implantation en environnement parallèle”, Laboratoire Productique–
Logistique, École Centrale, Paris, France, November 30 1994.
203. Gendron B., “Parallelism at the C.R.T. and Examples from Network Design Research”, Dipartimento di informatica, Università di Pisa, Pisa, Italy, November 24
1994.
204. Gendron B., “Relaxations for Multicommodity Capacitated Network Design Problems”, Dipartimento di informatica e sistemistica, Università di Roma La Sapienza,
Roma, Italy, July 7 1994.
205. Gendron B., “Relaxations for Multicommodity Capacitated Network Design Problems”, Dipartimento di informatica, Università di Pisa, Pisa, Italy, June 21 1994.
206. Gendron B., “Relaxations for Multicommodity Capacitated Network Design Problems”, Operations Research Center, Massachusetts Institute of Technology, Cambridge, U.S.A., May 2 1994.
207. Gendron B., “Parallélisme et problèmes de conception de réseaux”, Centre de
recherche sur les transports, Université de Montréal, Montréal, Canada, March
17 1994.
33