Bernard Gendron

According to our database1, Bernard Gendron authored at least 77 papers between 1994 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Revisiting Lagrangian relaxation for network design.
Discrete Applied Mathematics, 2019

Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016.
Discrete Applied Mathematics, 2019

Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes.
CoRR, 2019

The p-arborescence star problem: Formulations and exact solution approaches.
Computers & OR, 2019

2018
Dynamic smoothness parameter for fast gradient methods.
Optimization Letters, 2018

Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design.
European Journal of Operational Research, 2018

The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design.
EURO J. Computational Optimization, 2018

Combining Benders decomposition and column generation for multi-activity tour scheduling.
Computers & OR, 2018

2017
Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems.
Transportation Science, 2017

Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design.
Transportation Science, 2017

A general variable neighborhood search variants for the travelling salesman problem with draft limits.
Optimization Letters, 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 Journal on Computing, 2017

Energy efficiency and traffic offloading in wireless mesh networks with delay bounds.
Int. J. Communication Systems, 2017

A two-stage stochastic programming approach for multi-activity tour scheduling.
European Journal of Operational Research, 2017

A general variable neighborhood search for the swap-body vehicle routing problem.
Computers & OR, 2017

Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints.
Computers & OR, 2017

Real-time management of transportation disruptions in forestry.
Computers & OR, 2017

2016
A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints.
Transportation Science, 2016

Branch-and-Price for Personalized Multiactivity Tour Scheduling.
INFORMS Journal on Computing, 2016

A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks.
European Journal of Operational Research, 2016

Solving a dynamic facility location problem with partial closing and reopening.
Computers & OR, 2016

Grammar-Based Integer Programming Models and Methods for Employee Scheduling Problems.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

Service Network Design of Bike Sharing Systems with Resource Constraints.
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

Generalization of capacitated p-median location problem: Modeling and resolution.
Proceedings of the 3rd International Conference on Logistics Operations Management, 2016

2015
Dynamic Facility Location with Generalized Modular Capacities.
Transportation Science, 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.
Computers & OR, 2015

Modeling and solving a logging camp location problem.
Annals OR, 2015

2014
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem.
J. Scheduling, 2014

Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem.
INFORMS Journal on Computing, 2014

An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem.
INFORMS Journal on Computing, 2014

A GRASP + ILP-based metaheuristic for the capacitated location-routing problem.
J. Heuristics, 2014

Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design.
EURO J. Computational Optimization, 2014

The greening potential of content delivery in residential community networks.
Computer 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
A stabilized structured Dantzig-Wolfe decomposition method.
Math. Program., 2013

Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling.
INFORMS Journal on Computing, 2013

The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method.
Electronic Notes in Discrete Mathematics, 2013

Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks.
Electronic Notes in Discrete Mathematics, 2013

A computational comparison of flow formulations for the capacitated location-routing problem.
Discrete Optimization, 2013

A cutting plane algorithm for the Capacitated Connected Facility Location Problem.
Comp. Opt. and Appl., 2013

2012
Total domination and the Caccetta-Häggkvist conjecture.
Discrete Optimization, 2012

2011
Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling.
Management Science, 2011

Formal languages for integer programming modeling of shift scheduling problems.
Constraints, 2011

2010
Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling.
Electronic Notes in Discrete Mathematics, 2010

2009
0-1 reformulations of the multicommodity capacitated network design problem.
Discrete Applied Mathematics, 2009

Special issue on constraint programming.
Computers & OR, 2009

Formulations and relaxations for a multi-echelon capacitated location-distribution problem.
Computers & OR, 2009

Benders, metric and cutset inequalities for multicommodity capacitated network design.
Comp. Opt. and 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

Grammar-Based Integer Programing Models for Multi-Activity Shift Scheduling.
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.
Discrete Optimization, 2008

2007
On edge orienting methods for graph coloring.
J. Comb. Optim., 2007

Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs.
Operations Research, 2007

A Word from the Editor.
INFOR, 2007

Modeling the Regular Constraint with Integer Programming.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

2006
Physician Scheduling in Emergency Rooms.
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006

2005
Scheduling Employees in Quebec's Liquor Stores with Integer Programming.
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
Models and Methods for Merge - in - Transit Operations.
Transportation Science, 2003

Foreword to the Special Issue on Aviation Operations Research: Commemorating 100 Years of Aviation.
Transportation Science, 2003

A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements.
Parallel Computing, 2003

A Comparison of Mixed - Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems.
Management Science, 2003

A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements.
Annals OR, 2003

2002
Diversification strategies in local search for a nonbifurcated network loading problem.
European Journal of Operational Research, 2002

A note on "a dual-ascent approach to the fixed-charge capacitated network design problem".
European Journal of Operational Research, 2002

2001
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design.
Discrete Applied Mathematics, 2001

2000
Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem.
Parallel Computing, 2000

Tabu Search for a Network Loading Problem with Multiple Facilities.
J. Heuristics, 2000

1997
A parallel branch-and-bound algorithm for multicommodity location with balancing requirements.
Computers & OR, 1997

1994
Parallel Branch-and-Branch Algorithms: Survey and Synthesis.
Operations Research, 1994


  Loading...