Bernard Gendron
Orcid: 0000-0002-7417-1940
According to our database1,
Bernard Gendron
authored at least 98 papers
between 1994 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches.
Discret. Appl. Math., January, 2024
INFORMS J. Comput., 2024
A logistics provider's profit maximization facility location problem with random utility maximizing followers.
Comput. Oper. Res., 2024
2023
Networks, December, 2023
Math. Program., November, 2023
Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models.
INFORMS J. Comput., 2023
2022
INFORMS J. Comput., 2022
An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model.
Eur. J. Oper. Res., 2022
A taxonomy of multilayer network design and a survey of transportation and telecommunication applications.
Eur. J. Oper. Res., 2022
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design.
Discret. Appl. Math., 2022
Comput. Oper. Res., 2022
A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements.
Comput. Oper. Res., 2022
2021
2020
Transp. Sci., 2020
Two-Stage Stochastic Mixed-Integer Programming with Chance Constraints for Extended Aircraft Arrival Management.
Transp. Sci., 2020
Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel.
Eur. J. Oper. Res., 2020
Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes.
Comput. Oper. Res., 2020
Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020
Energy-efficient resource allocation in wireless LANs under non-linear capacity constraints.
Proceedings of the 25th IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, 2020
2019
Discret. Appl. Math., 2019
Comput. Oper. Res., 2019
2018
Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design.
Eur. J. Oper. Res., 2018
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design.
EURO J. Comput. Optim., 2018
Combining Benders decomposition and column generation for multi-activity tour scheduling.
Comput. Oper. Res., 2018
2017
Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems.
Transp. Sci., 2017
Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design.
Transp. Sci., 2017
A general variable neighborhood search variants for the travelling salesman problem with draft limits.
Optim. Lett., 2017
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds.
Math. Program. Comput., 2017
Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities.
INFORMS J. Comput., 2017
Energy efficiency and traffic offloading in wireless mesh networks with delay bounds.
Int. J. Commun. Syst., 2017
Eur. J. Oper. Res., 2017
Comput. Oper. Res., 2017
Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints.
Comput. Oper. Res., 2017
Comput. Oper. Res., 2017
2016
A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints.
Transp. Sci., 2016
INFORMS J. Comput., 2016
A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks.
Eur. J. Oper. Res., 2016
Comput. Oper. Res., 2016
Grammar-Based Integer Programming Models and Methods for Employee Scheduling Problems.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016
Proceedings of the Computational Logistics - 7th International Conference, 2016
Strategic planning problem represented by a three-echelon logistics network-modeling and solving.
Proceedings of the 3rd International Conference on Logistics Operations Management, 2016
Proceedings of the 3rd International Conference on Logistics Operations Management, 2016
2015
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment.
Networks, 2015
Formulations and exact solution approaches for the degree preserving spanning tree problem.
Networks, 2015
Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem.
Comput. Oper. Res., 2015
2014
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem.
J. Sched., 2014
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem.
INFORMS J. Comput., 2014
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem.
INFORMS J. Comput., 2014
J. Heuristics, 2014
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design.
EURO J. Comput. Optim., 2014
Comput. Networks, 2014
Energy efficiency and traffic offloading in WLANs with caching and mesh capabilities.
Proceedings of the 2014 26th International Teletraffic Congress (ITC), 2014
2013
INFORMS J. Comput., 2013
The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method.
Electron. Notes Discret. Math., 2013
Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks.
Electron. Notes Discret. Math., 2013
A computational comparison of flow formulations for the capacitated location-routing problem.
Discret. Optim., 2013
Comput. Optim. Appl., 2013
2012
2011
Manag. Sci., 2011
Constraints An Int. J., 2011
2010
Electron. Notes Discret. Math., 2010
2009
Discret. Appl. Math., 2009
Formulations and relaxations for a multi-echelon capacitated location-distribution problem.
Comput. Oper. Res., 2009
Benders, metric and cutset inequalities for multicommodity capacitated network design.
Comput. Optim. Appl., 2009
Formulations, Bounds and Heuristic Methods for a Two-Echelon Adaptive Location-Distribution Problem.
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009
2008
On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem.
Oper. Res. Lett., 2008
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs.
Networks, 2008
A sequential elimination algorithm for computing bounds on the clique number of a graph.
Discret. Optim., 2008
2007
Oper. Res., 2007
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007
2006
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006
2005
Interfaces, 2005
Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2005
2004
A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design.
J. Heuristics, 2004
2003
Foreword to the Special Issue on Aviation Operations Research: Commemorating 100 Years of Aviation.
Transp. Sci., 2003
A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements.
Parallel Comput., 2003
A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems.
Manag. Sci., 2003
A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements.
Ann. Oper. Res., 2003
2002
Diversification strategies in local search for a nonbifurcated network loading problem.
Eur. J. Oper. Res., 2002
A note on "a dual-ascent approach to the fixed-charge capacitated network design problem".
Eur. J. Oper. Res., 2002
2001
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design.
Discret. Appl. Math., 2001
2000
Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem.
Parallel Comput., 2000
J. Heuristics, 2000
1997
A parallel branch-and-bound algorithm for multicommodity location with balancing requirements.
Comput. Oper. Res., 1997
1994