Bernard Gendron

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 50

Top Venues

Publications

Eric Larsen, Emma Frejinger, Bernard Gendron, Andrea Lodi
Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning. INFORMS J. Comput. 36 (1) (2024)
Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena
Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches. Discret. Appl. Math. 343 (2024)
David Pinzon Ulloa, Emma Frejinger, Bernard Gendron
A logistics provider's profit maximization facility location problem with random utility maximizing followers. Comput. Oper. Res. 167 (2024)
Steven Lamontagne, Margarida Carvalho, Emma Frejinger, Bernard Gendron, Miguel F. Anjos, Ribal Atallah
Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models. INFORMS J. Comput. 35 (5) (2023)
Robin Legault, Jean-François Côté, Bernard Gendron
A novel reformulation for the single-sink fixed-charge transportation problem. Math. Program. 202 (1) (2023)
Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena
Two-stage stochastic one-to-many driver matching for ridesharing. Networks 82 (4) (2023)
Eric Larsen, Emma Frejinger, Bernard Gendron, Andrea Lodi
Fast Continuous and Integer L-shaped Heuristics Through Supervised Learning. CoRR (2022)
Anis Kadri, Oumar Koné, Bernard Gendron
A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements. Comput. Oper. Res. 142 (2022)
Teodor Gabriel Crainic, Bernard Gendron, Mohammad Rahim Akhavan Kazemzadeh
A taxonomy of multilayer network design and a survey of transportation and telecommunication applications. Eur. J. Oper. Res. 303 (1) (2022)
Christine Tawfik, Bernard Gendron, Sabine Limbourg
An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model. Eur. J. Oper. Res. 300 (2) (2022)
Meritxell Pacheco Paneque, Bernard Gendron, Shadi Sharif Azadeh, Michel Bierlaire
A Lagrangian decomposition scheme for choice-based optimization. Comput. Oper. Res. 148 (2022)
Olivier Lalonde, Jean-François Côté, Bernard Gendron
A Branch-and-Price Algorithm for the Multiple Knapsack Problem. INFORMS J. Comput. 34 (6) (2022)
Quang Minh Bui, Bernard Gendron, Margarida Carvalho
A Catalog of Formulations for the Network Pricing Problem. INFORMS J. Comput. 34 (5) (2022)
Mohammad Rahim Akhavan Kazemzadeh, Tolga Bektas, Teodor Gabriel Crainic, Antonio Frangioni, Bernard Gendron, Enrico Gorgone
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design. Discret. Appl. Math. 308 (2022)
Quang Minh Bui, Bernard Gendron, Margarida Carvalho
A Catalog of Formulations for the Network Pricing Problem. CoRR (2021)
Rosario Giuseppe Garroppo, Gianfranco Nencioni, Luca Tavanti, Bernard Gendron, Maria Grazia Scutellà
Optimal Access Point Power Management for Green IEEE 802.11 Networks. Sensors 21 (6) (2021)
Ahmed Khassiba, Fabian Bastin, Sonia Cafieri, Bernard Gendron, Marcel Mongeau
Two-Stage Stochastic Mixed-Integer Programming with Chance Constraints for Extended Aircraft Arrival Management. Transp. Sci. 54 (4) (2020)
Antonio Frangioni, Bernard Gendron, Enrico Gorgone
Quasi-Separable Dantzig-Wolfe Reformulations for Network Design. ISCO (2020)
Bruno Albert Neumann-Saavedra, Teodor Gabriel Crainic, Bernard Gendron, Dirk Christian Mattfeld, Michael Römer
Integrating Resource Management in Service Network Design for Bike-Sharing Systems. Transp. Sci. 54 (5) (2020)
Miguel F. Anjos, Bernard Gendron, Martim Joyce-Moniz
Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel. Eur. J. Oper. Res. 285 (1) (2020)
Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena
Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions. ISCO (2020)
Shahin Gelareh, Bernard Gendron, Saïd Hanafi, Rahimeh Neamatian Monemi, Raca Todosijevic
The selective traveling salesman problem with draft limits. J. Heuristics 26 (3) (2020)
Janniele A. S. Araujo, Haroldo G. Santos, Bernard Gendron, Sanjay Dominik Jena, Samuel S. Brito, Danilo S. Souza
Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes. Comput. Oper. Res. 113 (2020)
Rosario Giuseppe Garroppo, Gianfranco Nencioni, Luca Tavanti, Bernard Gendron, Maria Grazia Scutellà
Energy-efficient resource allocation in wireless LANs under non-linear capacity constraints. CAMAD (2020)
Janniele A. S. Araujo, Haroldo Gambini Santos, Bernard Gendron, Sanjay Dominik Jena, Samuel S. Brito, Danilo S. Souza
Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes. CoRR (2019)
Bernard Gendron
Revisiting Lagrangian relaxation for network design. Discret. Appl. Math. 261 (2019)
Yves Crama, Bernard Gendron, Bernard Ries
Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016. Discret. Appl. Math. 261 (2019)
Vinicius Morais, Bernard Gendron, Geraldo Robson Mateus
-arborescence star problem: Formulations and exact solution approaches. Comput. Oper. Res. 102 (2019)
Antonio Frangioni, Bernard Gendron, Enrico Gorgone
Dynamic smoothness parameter for fast gradient methods. Optim. Lett. 12 (1) (2018)
Bernard Gendron, Saïd Hanafi, Raca Todosijevic
Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design. Eur. J. Oper. Res. 268 (1) (2018)
Mervat Chouman, Teodor Gabriel Crainic, Bernard Gendron
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design. EURO J. Comput. Optim. 6 (2) (2018)
Maria I. Restrepo, Bernard Gendron, Louis-Martin Rousseau
Combining Benders decomposition and column generation for multi-activity tour scheduling. Comput. Oper. Res. 93 (2018)
Mervat Chouman, Teodor Gabriel Crainic, Bernard Gendron
Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design. Transp. Sci. 51 (2) (2017)
Maria I. Restrepo, Bernard Gendron, Louis-Martin Rousseau
A two-stage stochastic programming approach for multi-activity tour scheduling. Eur. J. Oper. Res. 262 (2) (2017)
Raca Todosijevic, Saïd Hanafi, Dragan Urosevic, Bassem Jarboui, Bernard Gendron
A general variable neighborhood search for the swap-body vehicle routing problem. Comput. Oper. Res. 78 (2017)
Amine Amrouss, Nizar El Hachemi, Michel Gendreau, Bernard Gendron
Real-time management of transportation disruptions in forestry. Comput. Oper. Res. 83 (2017)
Rosario Giuseppe Garroppo, Bernard Gendron, Gianfranco Nencioni, Luca Tavanti
Energy efficiency and traffic offloading in wireless mesh networks with delay bounds. Int. J. Commun. Syst. 30 (2) (2017)
Raca Todosijevic, Anis Mjirda, Marko Mladenovic, Saïd Hanafi, Bernard Gendron
A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optim. Lett. 11 (6) (2017)
Bernard Gendron, Luis Eduardo Neves Gouveia
Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems. Transp. Sci. 51 (2) (2017)
Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron
Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities. INFORMS J. Comput. 29 (3) (2017)
Bernard Gendron, Paul-Virak Khuong, Frédéric Semet
Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints. Comput. Oper. Res. 86 (2017)
Antonio Frangioni, Bernard Gendron, Enrico Gorgone
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds. Math. Program. Comput. 9 (4) (2017)
Bruno Albert Neumann-Saavedra, Teodor Gabriel Crainic, Bernard Gendron, Dirk Christian Mattfeld, Michael Römer
Service Network Design of Bike Sharing Systems with Resource Constraints. ICCL (2016)
Bernard Gendron, Louis-Martin Rousseau
Grammar-Based Integer Programming Models and Methods for Employee Scheduling Problems. ISAIM (2016)
Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron
Solving a dynamic facility location problem with partial closing and reopening. Comput. Oper. Res. 67 (2016)
Mohammed El Amrani, Youssef Benadada, Bernard Gendron
Generalization of capacitated p-median location problem: Modeling and resolution. GOL (2016)
Bernard Gendron, Maria Grazia Scutellà, Rosario Giuseppe Garroppo, Gianfranco Nencioni, Luca Tavanti
A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks. Eur. J. Oper. Res. 255 (1) (2016)
Maria I. Restrepo, Bernard Gendron, Louis-Martin Rousseau
Branch-and-Price for Personalized Multiactivity Tour Scheduling. INFORMS J. Comput. 28 (2) (2016)
Bernard Gendron, Paul-Virak Khuong, Frédéric Semet
A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints. Transp. Sci. 50 (4) (2016)
Yahya Hamada, Youssef Benadada, Bernard Gendron
Strategic planning problem represented by a three-echelon logistics network-modeling and solving. GOL (2016)
Bernard Gendron, Paul-Virak Khuong, Frédéric Semet
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment. Networks 66 (3) (2015)
Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena, Bernard Gendron
Formulations and exact solution approaches for the degree preserving spanning tree problem. Networks 65 (4) (2015)
Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron
Modeling and solving a logging camp location problem. Ann. Oper. Res. 232 (1) (2015)
Babacar Thiongane, Jean-François Cordeau, Bernard Gendron
Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem. Comput. Oper. Res. 53 (2015)
Sanjay Dominik Jena, Jean-François Cordeau, Bernard Gendron
Dynamic Facility Location with Generalized Modular Capacities. Transp. Sci. 49 (3) (2015)
Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem. INFORMS J. Comput. 26 (4) (2014)
Rosario Giuseppe Garroppo, Gianfranco Nencioni, Luca Tavanti, Bernard Gendron
The greening potential of content delivery in residential community networks. Comput. Networks 73 (2014)
Vincent Boyer, Bernard Gendron, Louis-Martin Rousseau
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem. J. Sched. 17 (2) (2014)
Claudio Contardo, Jean-François Cordeau, Bernard Gendron
A GRASP + ILP-based metaheuristic for the capacitated location-routing problem. J. Heuristics 20 (1) (2014)
Claudio Contardo, Jean-François Cordeau, Bernard Gendron
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem. INFORMS J. Comput. 26 (1) (2014)
Bernard Gendron, Mathieu Larose
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design. EURO J. Comput. Optim. 2 (1-2) (2014)
Rosario Giuseppe Garroppo, Gianfranco Nencioni, Gregorio Procissi, Luca Tavanti, Bernard Gendron
Energy efficiency and traffic offloading in WLANs with caching and mesh capabilities. International Teletraffic Congress (2014)
Antonio Frangioni, Bernard Gendron
A stabilized structured Dantzig-Wolfe decomposition method. Math. Program. 140 (1) (2013)
Bernard Gendron, Rosario Giuseppe Garroppo, Gianfranco Nencioni, Maria Grazia Scutellà, Luca Tavanti
Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks. Electron. Notes Discret. Math. 41 (2013)
Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti
The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method. Electron. Notes Discret. Math. 41 (2013)
Claudio Contardo, Jean-François Cordeau, Bernard Gendron
A computational comparison of flow formulations for the capacitated location-routing problem. Discret. Optim. 10 (4) (2013)
Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau
Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling. INFORMS J. Comput. 25 (3) (2013)
Stefan Gollowitzer, Bernard Gendron, Ivana Ljubic
A cutting plane algorithm for the Capacitated Connected Facility Location Problem. Comput. Optim. Appl. 55 (3) (2013)
Patrick St-Louis, Bernard Gendron, Alain Hertz
Total domination and the Caccetta-Häggkvist conjecture. Discret. Optim. 9 (4) (2012)
Marie-Claude Côté, Bernard Gendron, Claude-Guy Quimper, Louis-Martin Rousseau
Formal languages for integer programming modeling of shift scheduling problems. Constraints An Int. J. 16 (1) (2011)
Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau
Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling. Manag. Sci. 57 (1) (2011)
Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau
Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling. Electron. Notes Discret. Math. 36 (2010)
Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau
Grammar-Based Integer Programing Models for Multi-Activity Shift Scheduling. Models and Algorithms for Optimization in Logistics (2009)
Alysson M. Costa, Jean-François Cordeau, Bernard Gendron
Benders, metric and cutset inequalities for multicommodity capacitated network design. Comput. Optim. Appl. 42 (3) (2009)
Antonio Frangioni, Bernard Gendron
0-1 reformulations of the multicommodity capacitated network design problem. Discret. Appl. Math. 157 (6) (2009)
Gilles Pesant, Meinolf Sellmann, Bernard Gendron
Special issue on constraint programming. Comput. Oper. Res. 36 (8) (2009)
Bernard Gendron, Frédéric Semet
Formulations and relaxations for a multi-echelon capacitated location-distribution problem. Comput. Oper. Res. 36 (5) (2009)
Bernard Gendron, Paul-Virak Khuong, Frédéric Semet
Formulations, Bounds and Heuristic Methods for a Two-Echelon Adaptive Location-Distribution Problem. Models and Algorithms for Optimization in Logistics (2009)
Maurício C. de Souza, Philippe Mahey, Bernard Gendron
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs. Networks 51 (2) (2008)
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) (2008)
Bernard Gendron, Alain Hertz, Patrick St-Louis
A sequential elimination algorithm for computing bounds on the clique number of a graph. Discret. Optim. 5 (3) (2008)
Marie-Claude Côté, Bernard Gendron, Louis-Martin Rousseau
Modeling the Regular Constraint with Integer Programming. CPAIOR (2007)
Bernard Gendron, Alain Hertz, Patrick St-Louis
On edge orienting methods for graph coloring. J. Comb. Optim. 13 (2) (2007)
Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs. Oper. Res. 55 (1) (2007)
Bernard Gendron
A Word from the Editor. INFOR Inf. Syst. Oper. Res. 45 (1) (2007)
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)
Bernard Gendron
Scheduling Employees in Quebec's Liquor Stores with Integer Programming. Interfaces 35 (5) (2005)
Bernard Gendron, Hocine Lebbah, Gilles Pesant
Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation. CPAIOR (2005)
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) (2004)
John-Paul Clarke, Bernard Gendron
Foreword to the Special Issue on Aviation Operations Research: Commemorating 100 Years of Aviation. Transp. Sci. 37 (4) (2003)
Bernard Gendron, Jean-Yves Potvin, Patrick Soriano
A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements. Parallel Comput. 29 (5) (2003)
Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti
Models and Methods for Merge - in - Transit Operations. Transp. Sci. 37 (1) (2003)
Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti
A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems. Manag. Sci. 49 (9) (2003)
Bernard Gendron, Jean-Yves Potvin, Patrick Soriano
A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements. Ann. Oper. Res. 122 (1-4) (2003)
Bernard Gendron, Jean-Yves Potvin, Patrick Soriano
Diversification strategies in local search for a nonbifurcated network loading problem. Eur. J. Oper. Res. 142 (2) (2002)
Bernard Gendron
A note on "a dual-ascent approach to the fixed-charge capacitated network design problem". Eur. J. Oper. Res. 138 (3) (2002)
Teodor Gabriel Crainic, Antonio Frangioni, Bernard Gendron
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discret. Appl. Math. 112 (1-3) (2001)
Benoît Bourbeau, Teodor Gabriel Crainic, Bernard Gendron
Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem. Parallel Comput. 26 (1) (2000)
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) (2000)
Bernard Gendron, Teodor Gabriel Crainic
A parallel branch-and-bound algorithm for multicommodity location with balancing requirements. Comput. Oper. Res. 24 (9) (1997)

Bernard Gendron.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Bernard Gendron