Gendron Bernard

Bernard Gendron

Information about the author Bernard Gendron will soon be added to the site.
Found 28 papers in total
A general variable neighborhood search variants for the travelling salesman problem with draft limits
A general variable neighborhood search variants for the travelling salesman problem with draft limits
2017
In this paper, we present two general variable neighborhood search (GVNS) based...
Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems
Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems
2017
We consider the piecewise linear multicommodity network flow problem with the addition...
Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design
Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design
2017
We improve the mixed‐integer programming formulation of the multicommodity...
Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities
Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities
2017
We consider the dynamic facility location problem with generalized modular capacities,...
A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints
A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints
2016
We consider the two‐level uncapacitated facility location problem with...
Solving a dynamic facility location problem with partial closing and reopening
Solving a dynamic facility location problem with partial closing and reopening
2016
Motivated by an industrial application, we consider a recently introduced multi-period...
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment
Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment
2015
We develop a variant of the variable neighborhood search (VNS) metaheuristic called...
Grammar‐Based Column Generation for Personalized Multi‐Activity Shift Scheduling
Grammar‐Based Column Generation for Personalized Multi‐Activity Shift Scheduling
2013
We present a branch‐and‐price algorithm to solve personalized...
A cutting plane algorithm for the Capacitated Connected Facility Location Problem
A cutting plane algorithm for the Capacitated Connected Facility Location Problem
2013
We consider a network design problem that arises in the cost‐optimal design of...
Total domination and the Caccetta–Häggkvist conjecture
Total domination and the Caccetta–Häggkvist conjecture
2012
A total dominating set in a digraph G is a subset W of its vertices such that every...
Grammar‐Based Integer Programming Models for Multiactivity Shift Scheduling
Grammar‐Based Integer Programming Models for Multiactivity Shift Scheduling
2011
This paper presents a new implicit formulation for shift scheduling problems, using...
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs
2008
We present cycle-based algorithmic approaches to find local minima of a nonconvex and...
Variable disaggregation in network flow problems with piecewise linear costs
Variable disaggregation in network flow problems with piecewise linear costs
2007
We study mixed-integer programming formulations, based upon variable disaggregation,...
A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
2003
We study a generic minimization problem with separable nonconvex piecewise linear...
A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements
A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements
2003
In this paper, a parallel hybrid heuristic is developed for the multicommodity...
Scheduling employees in Quebec's liquor stores with integer programming
Scheduling employees in Quebec's liquor stores with integer programming
2005
The SAQ (in French, Société des alcools du Québec) is a public...
A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
2004
This paper describes a slope scaling heuristic for solving the multicommodity...
A tabu search heuristic for scheduling the production processes at an oil refinery
A tabu search heuristic for scheduling the production processes at an oil refinery
2004
In this paper we present a tabu search heuristic which can be used for scheduling the...
A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
2003
In this paper, a tabu search heuristic is combined with slope scaling to solve a...
Diversification strategies in local search for a nonbifurcated network loading problem
Diversification strategies in local search for a nonbifurcated network loading problem
2002
This paper examines a variant of the network loading problem, a network design problem...
Tabu search for a network loading problem with multiple facilities
Tabu search for a network loading problem with multiple facilities
2000
This paper examines a network design problem that arises in the telecommunications...
A note on ‘a dual-ascent approach to the fixed-charge capacitated network design problem’
A note on ‘a dual-ascent approach to the fixed-charge capacitated network design problem’
2002
We show by a counterexample that the dual-ascent procedure proposed by Herrmann,...
A mathematical programming approach for scheduling physicians in the emergency room
A mathematical programming approach for scheduling physicians in the emergency room
2000
Preparing a schedule for physicians in the emergency room is a complex task, which...
Tabu search with exact neighbour evaluation for multicommodity location with balancing requirements
Tabu search with exact neighbour evaluation for multicommodity location with balancing requirements
1999
In this paper, we present a tabu search heuristic for solving the multicommodity...
Papers per page: