2009 |
16 | EE | Bernard Gendron,
Frédéric Semet:
Formulations and relaxations for a multi-echelon capacitated location-distribution problem.
Computers & OR 36(5): 1335-1355 (2009) |
2008 |
15 | EE | Bernard Gendron,
Alain Hertz,
Patrick St-Louis:
A sequential elimination algorithm for computing bounds on the clique number of a graph.
Discrete Optimization 5(3): 615-628 (2008) |
14 | EE | Mauricio C. de Souza,
Philippe Mahey,
Bernard Gendron:
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs.
Networks 51(2): 133-141 (2008) |
13 | EE | Bernard Gendron,
Alain Hertz,
Patrick St-Louis:
On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem.
Oper. Res. Lett. 36(3): 345-350 (2008) |
2007 |
12 | EE | Marie-Claude Côté,
Bernard Gendron,
Louis-Martin Rousseau:
Modeling the Regular Constraint with Integer Programming.
CPAIOR 2007: 29-43 |
11 | EE | Bernard Gendron,
Alain Hertz,
Patrick St-Louis:
On edge orienting methods for graph coloring.
J. Comb. Optim. 13(2): 163-178 (2007) |
2006 |
10 | EE | Michel Gendreau,
Jacques A. Ferland,
Bernard Gendron,
Noureddine Hail,
Brigitte Jaumard,
Sophie D. Lapierre,
Gilles Pesant,
Patrick Soriano:
Physician Scheduling in Emergency Rooms.
PATAT 2006: 53-66 |
2005 |
9 | EE | Bernard Gendron,
Hocine Lebbah,
Gilles Pesant:
Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation.
CPAIOR 2005: 217-227 |
2004 |
8 | EE | Teodor Gabriel Crainic,
Bernard Gendron,
Geneviève Hernu:
A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design.
J. Heuristics 10(5): 525-545 (2004) |
2003 |
7 | EE | Bernard Gendron,
Jean-Yves Potvin,
Patrick Soriano:
A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements.
Annals OR 122(1-4): 193-217 (2003) |
6 | EE | Bernard Gendron,
Jean-Yves Potvin,
Patrick Soriano:
A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements.
Parallel Computing 29(5): 591-606 (2003) |
2002 |
5 | EE | Bernard Gendron,
Jean-Yves Potvin,
Patrick Soriano:
Diversification strategies in local search for a nonbifurcated network loading problem.
European Journal of Operational Research 142(2): 231-241 (2002) |
2001 |
4 | | Teodor Gabriel Crainic,
Antonio Frangioni,
Bernard Gendron:
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design.
Discrete Applied Mathematics 112(1-3): 73-99 (2001) |
2000 |
3 | | David Berger,
Bernard Gendron,
Jean-Yves Potvin,
S. Raghavan,
Patrick Soriano:
Tabu Search for a Network Loading Problem with Multiple Facilities.
J. Heuristics 6(2): 253-267 (2000) |
2 | | Benoît Bourbeau,
Teodor Gabriel Crainic,
Bernard Gendron:
Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem.
Parallel Computing 26(1): 27-46 (2000) |
1997 |
1 | EE | Bernard Gendron,
Teodor Gabriel Crainic:
A parallel branch-and-bound algorithm for multicommodity location with balancing requirements.
Computers & OR 24(9): 829-847 (1997) |