Parallel Branch-and-Branch Algorithms: Survey and Synthesis. - Bernard Gendron; Teodor Gabriel Crainic (Oper. Res., 1994)

A parallel branch-and-bound algorithm for multicommodity location with balancing requirements. - Bernard Gendron; Teodor Gabriel Crainic (Comput. Oper. Res., 1997)

Tabu Search for a Network Loading Problem with Multiple Facilities. - David Berger; Bernard Gendron; Jean-Yves Potvin; S. Raghavan; Patrick Soriano (J. Heuristics, 2000)

Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem. - Benoît Bourbeau; Teodor Gabriel Crainic; Bernard Gendron (Parallel Comput., 2000)

Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. - Teodor Gabriel Crainic; Antonio Frangioni; Bernard Gendron (Discret. Appl. Math., 2001)

A note on "a dual-ascent approach to the fixed-charge capacitated network design problem". - Bernard Gendron (Eur. J. Oper. Res., 2002)

Diversification strategies in local search for a nonbifurcated network loading problem. - Bernard Gendron; Jean-Yves Potvin; Patrick Soriano (Eur. J. Oper. Res., 2002)

A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements. - Bernard Gendron; Jean-Yves Potvin; Patrick Soriano (Ann. Oper. Res., 2003)

A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems. - Keely L. Croxton; Bernard Gendron; Thomas L. Magnanti (Manag. Sci., 2003)

A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements. - Bernard Gendron; Jean-Yves Potvin; Patrick Soriano (Parallel Comput., 2003)

Foreword to the Special Issue on Aviation Operations Research: Commemorating 100 Years of Aviation. - John-Paul Clarke; Bernard Gendron (Transp. Sci., 2003)

Models and Methods for Merge - in - Transit Operations. - Keely L. Croxton; Bernard Gendron; Thomas L. Magnanti (Transp. Sci., 2003)

A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design. - Teodor Gabriel Crainic; Bernard Gendron; Geneviève Hernu (J. Heuristics, 2004)

Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation. - Bernard Gendron; Hocine Lebbah; Gilles Pesant (CPAIOR, 2005)

Scheduling Employees in Quebec's Liquor Stores with Integer Programming. - Bernard Gendron (Interfaces, 2005)

Physician Scheduling in Emergency Rooms. - Michel Gendreau; Jacques A. Ferland; Bernard Gendron; Noureddine Hail; Brigitte Jaumard; Sophie D. Lapierre; Gilles Pesant; Patrick Soriano (PATAT, 2006)

Modeling the Regular Constraint with Integer Programming. - Marie-Claude Côté; Bernard Gendron; Louis-Martin Rousseau (CPAIOR, 2007)

A Word from the Editor. - Bernard Gendron (INFOR Inf. Syst. Oper. Res., 2007)

Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs. - Keely L. Croxton; Bernard Gendron; Thomas L. Magnanti (Oper. Res., 2007)

On edge orienting methods for graph coloring. - Bernard Gendron; Alain Hertz; Patrick St-Louis (J. Comb. Optim., 2007)

A sequential elimination algorithm for computing bounds on the clique number of a graph. - Bernard Gendron; Alain Hertz; Patrick St-Louis (Discret. Optim., 2008)

Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs. - Maurício C. de Souza; Philippe Mahey; Bernard Gendron (Networks, 2008)

On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem. - Bernard Gendron; Alain Hertz; Patrick St-Louis (Oper. Res. Lett., 2008)

Grammar-Based Integer Programing Models for Multi-Activity Shift Scheduling. - Marie-Claude Côté; Bernard Gendron; Louis-Martin Rousseau (Models and Algorithms for Optimization in Logistics, 2009)

Formulations, Bounds and Heuristic Methods for a Two-Echelon Adaptive Location-Distribution Problem. - Bernard Gendron; Paul-Virak Khuong; Frédéric Semet (Models and Algorithms for Optimization in Logistics, 2009)

Benders, metric and cutset inequalities for multicommodity capacitated network design. - Alysson M. Costa; Jean-François Cordeau; Bernard Gendron (Comput. Optim. Appl., 2009)

Formulations and relaxations for a multi-echelon capacitated location-distribution problem. - Bernard Gendron; Frédéric Semet (Comput. Oper. Res., 2009)

Special issue on constraint programming. - Gilles Pesant; Meinolf Sellmann; Bernard Gendron (Comput. Oper. Res., 2009)

0-1 reformulations of the multicommodity capacitated network design problem. - Antonio Frangioni; Bernard Gendron (Discret. Appl. Math., 2009)

Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling. - Marie-Claude Côté; Bernard Gendron; Louis-Martin Rousseau (Electron. Notes Discret. Math., 2010)

Formal languages for integer programming modeling of shift scheduling problems. - Marie-Claude Côté; Bernard Gendron; Claude-Guy Quimper; Louis-Martin Rousseau (Constraints An Int. J., 2011)

Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling. - Marie-Claude Côté; Bernard Gendron; Louis-Martin Rousseau (Manag. Sci., 2011)

Total domination and the Caccetta-Häggkvist conjecture. - Patrick St-Louis; Bernard Gendron; Alain Hertz (Discret. Optim., 2012)

A cutting plane algorithm for the Capacitated Connected Facility Location Problem. - Stefan Gollowitzer; Bernard Gendron; Ivana Ljubic (Comput. Optim. Appl., 2013)

A computational comparison of flow formulations for the capacitated location-routing problem. - Claudio Contardo; Jean-François Cordeau; Bernard Gendron (Discret. Optim., 2013)

Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks. - Bernard Gendron; Rosario Giuseppe Garroppo; Gianfranco Nencioni; Maria Grazia Scutellà; Luca Tavanti (Electron. Notes Discret. Math., 2013)

The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method. - Bernard Gendron; Abilio Lucena; Alexandre Salles da Cunha; Luidi Simonetti (Electron. Notes Discret. Math., 2013)

Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling. - Marie-Claude Côté; Bernard Gendron; Louis-Martin Rousseau (INFORMS J. Comput., 2013)

A stabilized structured Dantzig-Wolfe decomposition method. - Antonio Frangioni; Bernard Gendron (Math. Program., 2013)

Energy efficiency and traffic offloading in WLANs with caching and mesh capabilities. - Rosario Giuseppe Garroppo; Gianfranco Nencioni; Gregorio Procissi; Luca Tavanti; Bernard Gendron (ITC, 2014)

The greening potential of content delivery in residential community networks. - Rosario Giuseppe Garroppo; Gianfranco Nencioni; Luca Tavanti; Bernard Gendron (Comput. Networks, 2014)

Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design. - Bernard Gendron; Mathieu Larose (EURO J. Comput. Optim., 2014)

A GRASP + ILP-based metaheuristic for the capacitated location-routing problem. - Claudio Contardo; Jean-François Cordeau; Bernard Gendron (J. Heuristics, 2014)

An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem. - Claudio Contardo; Jean-François Cordeau; Bernard Gendron (INFORMS J. Comput., 2014)

Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem. - Bernard Gendron; Abilio Lucena; Alexandre Salles da Cunha; Luidi Simonetti (INFORMS J. Comput., 2014)

A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem. - Vincent Boyer 002; Bernard Gendron; Louis-Martin Rousseau (J. Sched., 2014)

Modeling and solving a logging camp location problem. - Sanjay Dominik Jena; Jean-François Cordeau; Bernard Gendron (Ann. Oper. Res., 2015)

Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem. - Babacar Thiongane; Jean-François Cordeau; Bernard Gendron (Comput. Oper. Res., 2015)

Formulations and exact solution approaches for the degree preserving spanning tree problem. - Alexandre Salles da Cunha; Luidi Simonetti; Abilio Lucena; Bernard Gendron (Networks, 2015)

Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment. - Bernard Gendron; Paul-Virak Khuong; Frédéric Semet (Networks, 2015)

Dynamic Facility Location with Generalized Modular Capacities. - Sanjay Dominik Jena; Jean-François Cordeau; Bernard Gendron (Transp. Sci., 2015)

Generalization of capacitated p-median location problem: Modeling and resolution. - Mohammed El Amrani; Youssef Benadada; Bernard Gendron (GOL, 2016)

Strategic planning problem represented by a three-echelon logistics network-modeling and solving. - Yahya Hamada; Youssef Benadada; Bernard Gendron (GOL, 2016)

Service Network Design of Bike Sharing Systems with Resource Constraints. - Bruno Albert Neumann-Saavedra; Teodor Gabriel Crainic; Bernard Gendron; Dirk Christian Mattfeld; Michael Römer (ICCL, 2016)

Grammar-Based Integer Programming Models and Methods for Employee Scheduling Problems. - Bernard Gendron; Louis-Martin Rousseau (ISAIM, 2016)

Solving a dynamic facility location problem with partial closing and reopening. - Sanjay Dominik Jena; Jean-François Cordeau; Bernard Gendron (Comput. Oper. Res., 2016)

A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks. - Bernard Gendron; Maria Grazia Scutellà; Rosario Giuseppe Garroppo; Gianfranco Nencioni; Luca Tavanti (Eur. J. Oper. Res., 2016)

Branch-and-Price for Personalized Multiactivity Tour Scheduling. - Maria I. Restrepo 001; Bernard Gendron; Louis-Martin Rousseau (INFORMS J. Comput., 2016)

A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints. - Bernard Gendron; Paul-Virak Khuong; Frédéric Semet (Transp. Sci., 2016)

Real-time management of transportation disruptions in forestry. - Amine Amrouss; Nizar El Hachemi; Michel Gendreau; Bernard Gendron (Comput. Oper. Res., 2017)

Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints. - Bernard Gendron; Paul-Virak Khuong; Frédéric Semet (Comput. Oper. Res., 2017)

A general variable neighborhood search for the swap-body vehicle routing problem. - Raca Todosijevic; Saïd Hanafi; Dragan Urosevic; Bassem Jarboui; Bernard Gendron (Comput. Oper. Res., 2017)

A two-stage stochastic programming approach for multi-activity tour scheduling. - Maria I. Restrepo 001; Bernard Gendron; Louis-Martin Rousseau (Eur. J. Oper. Res., 2017)

Energy efficiency and traffic offloading in wireless mesh networks with delay bounds. - Rosario Giuseppe Garroppo; Bernard Gendron; Gianfranco Nencioni; Luca Tavanti (Int. J. Commun. Syst., 2017)

Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities. - Sanjay Dominik Jena; Jean-François Cordeau; Bernard Gendron (INFORMS J. Comput., 2017)

On the computational efficiency of subgradient methods: a case study with Lagrangian bounds. - Antonio Frangioni; Bernard Gendron; Enrico Gorgone (Math. Program. Comput., 2017)

A general variable neighborhood search variants for the travelling salesman problem with draft limits. - Raca Todosijevic; Anis Mjirda; Marko Mladenovic; Saïd Hanafi; Bernard Gendron (Optim. Lett., 2017)

Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design. - Mervat Chouman; Teodor Gabriel Crainic; Bernard Gendron (Transp. Sci., 2017)

Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems. - Bernard Gendron; Luis Eduardo Neves Gouveia (Transp. Sci., 2017)

Combining Benders decomposition and column generation for multi-activity tour scheduling. - Maria I. Restrepo 001; Bernard Gendron; Louis-Martin Rousseau (Comput. Oper. Res., 2018)

The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design. - Mervat Chouman; Teodor Gabriel Crainic; Bernard Gendron (EURO J. Comput. Optim., 2018)

Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design. - Bernard Gendron; Saïd Hanafi; Raca Todosijevic (Eur. J. Oper. Res., 2018)

Dynamic smoothness parameter for fast gradient methods. - Antonio Frangioni; Bernard Gendron; Enrico Gorgone (Optim. Lett., 2018)

The p-arborescence star problem: Formulations and exact solution approaches. - Vinicius Morais; Bernard Gendron; Geraldo Robson Mateus (Comput. Oper. Res., 2019)

Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016. - Yves Crama; Bernard Gendron; Bernard Ries (Discret. Appl. Math., 2019)

Revisiting Lagrangian relaxation for network design. - Bernard Gendron (Discret. Appl. Math., 2019)

Energy-efficient resource allocation in wireless LANs under non-linear capacity constraints. - Rosario Giuseppe Garroppo; Gianfranco Nencioni; Luca Tavanti; Bernard Gendron; Maria Grazia Scutellà (CAMAD, 2020)

Quasi-Separable Dantzig-Wolfe Reformulations for Network Design. - Antonio Frangioni; Bernard Gendron; Enrico Gorgone (ISCO, 2020)

Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions. - Gabriel Homsi; Bernard Gendron; Sanjay Dominik Jena (ISCO, 2020)

Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes. - Janniele A. S. Araujo; Haroldo G. Santos; Bernard Gendron; Sanjay Dominik Jena; Samuel S. Brito; Danilo S. Souza (Comput. Oper. Res., 2020)

Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel. - Miguel F. Anjos; Bernard Gendron; Martim Joyce-Moniz (Eur. J. Oper. Res., 2020)

The selective traveling salesman problem with draft limits. - Shahin Gelareh; Bernard Gendron; Saïd Hanafi; Rahimeh Neamatian Monemi; Raca Todosijevic (J. Heuristics, 2020)

Two-Stage Stochastic Mixed-Integer Programming with Chance Constraints for Extended Aircraft Arrival Management. - Ahmed Khassiba; Fabian Bastin; Sonia Cafieri; Bernard Gendron; Marcel Mongeau (Transp. Sci., 2020)

Integrating Resource Management in Service Network Design for Bike-Sharing Systems. - Bruno Albert Neumann-Saavedra; Teodor Gabriel Crainic; Bernard Gendron; Dirk Christian Mattfeld; Michael Römer (Transp. Sci., 2020)

Optimal Access Point Power Management for Green IEEE 802.11 Networks. - Rosario Giuseppe Garroppo; Gianfranco Nencioni; Luca Tavanti; Bernard Gendron; Maria Grazia Scutellà (Sensors, 2021)

A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements. - Anis Kadri; Oumar Koné; Bernard Gendron (Comput. Oper. Res., 2022)

A Lagrangian decomposition scheme for choice-based optimization. - Meritxell Pacheco Paneque; Bernard Gendron; Shadi Sharif Azadeh; Michel Bierlaire (Comput. Oper. Res., 2022)

Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design. - Mohammad Rahim Akhavan Kazemzadeh; Tolga Bektas; Teodor Gabriel Crainic; Antonio Frangioni; Bernard Gendron; Enrico Gorgone (Discret. Appl. Math., 2022)

A taxonomy of multilayer network design and a survey of transportation and telecommunication applications. - Teodor Gabriel Crainic; Bernard Gendron; Mohammad Rahim Akhavan Kazemzadeh (Eur. J. Oper. Res., 2022)

An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model. - Christine Tawfik; Bernard Gendron; Sabine Limbourg (Eur. J. Oper. Res., 2022)

A Catalog of Formulations for the Network Pricing Problem. - Quang Minh Bui; Bernard Gendron; Margarida Carvalho (INFORMS J. Comput., 2022)

A Branch-and-Price Algorithm for the Multiple Knapsack Problem. - Olivier Lalonde; Jean-François Côté; Bernard Gendron (INFORMS J. Comput., 2022)

Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models. - Steven Lamontagne; Margarida Carvalho; Emma Frejinger; Bernard Gendron; Miguel F. Anjos; Ribal Atallah (INFORMS J. Comput., 2023)

A novel reformulation for the single-sink fixed-charge transportation problem. - Robin Legault; Jean-François Côté; Bernard Gendron (Math. Program., 2023)

Two-stage stochastic one-to-many driver matching for ridesharing. - Gabriel Homsi; Bernard Gendron; Sanjay Dominik Jena (Networks, 2023)

A logistics provider's profit maximization facility location problem with random utility maximizing followers. - David Pinzon Ulloa; Emma Frejinger; Bernard Gendron (Comput. Oper. Res., 2024)

Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning. - Eric Larsen; Emma Frejinger; Bernard Gendron; Andrea Lodi 001 (INFORMS J. Comput., 2024)

Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches. - Gabriel Homsi; Bernard Gendron; Sanjay Dominik Jena (Discret. Appl. Math., 2024)

LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization. - Julien Codsi; Sandra Ulrich Ngueveu; Bernard Gendron (Math. Program. Comput., 2025)