Bernard Gendron

From MaRDI portal
Person:210510

Available identifiers

zbMath Open gendron.bernardDBLP86/3756WikidataQ102078719 ScholiaQ102078719MaRDI QIDQ210510

List of research outcomes





PublicationDate of PublicationType
A logistics provider's profit maximization facility location problem with random utility maximizing followers2024-07-08Paper
Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning2024-03-26Paper
Optimising Electric Vehicle Charging Station Placement Using Advanced Discrete Choice Models2024-03-22Paper
Two‐stage stochastic one‐to‐many driver matching for ridesharing2024-01-18Paper
Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches2024-01-02Paper
A novel reformulation for the single-sink fixed-charge transportation problem2023-10-23Paper
Revue Des Inégalités Valides Pertinentes Aux Problèmes Des Conception De Réseaux2023-05-05Paper
Tabu Search With Exact Neighbor Evaluation For Multicommodity Location With Balancing Requirements2023-04-21Paper
On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations2023-03-27Paper
A Logistics Provider's Profit Maximization Facility Location Problem with Random Utility Maximizing Followers2023-03-12Paper
A Branch-and-Price Algorithm for the Multiple Knapsack Problem2023-01-11Paper
A Catalog of Formulations for the Network Pricing Problem2022-12-01Paper
A Lagrangian decomposition scheme for choice-based optimization2022-09-27Paper
A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements2022-06-22Paper
A taxonomy of multilayer network design and a survey of transportation and telecommunication applications2022-06-10Paper
An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model2022-03-18Paper
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design2022-01-05Paper
Dynamic and stochastic rematching for ridesharing systems: formulations and reductions2021-02-04Paper
Quasi-separable Dantzig-Wolfe reformulations for network design2021-02-04Paper
Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel2020-05-26Paper
Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning2020-05-26Paper
Strong bounds for resource constrained project scheduling: preprocessing and cutting planes2019-11-11Paper
Revisiting Lagrangian relaxation for network design2019-05-17Paper
The \(p\)-arborescence star problem: formulations and exact solution approaches2018-12-03Paper
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design2018-11-07Paper
A computational comparison of flow formulations for the capacitated location-routing problem2018-10-18Paper
Combining Benders decomposition and column generation for multi-activity tour scheduling2018-07-11Paper
A general variable neighborhood search for the swap-body vehicle routing problem2018-07-11Paper
Real-time management of transportation disruptions in forestry2018-07-11Paper
Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints2018-07-11Paper
Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design2018-05-30Paper
Multilayer variable neighborhood search for two‐level uncapacitated facility location problems with single assignment2018-05-23Paper
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds2018-02-21Paper
Dynamic smoothness parameter for fast gradient methods2018-02-09Paper
Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities2017-12-29Paper
A two-stage stochastic programming approach for multi-activity tour scheduling2017-12-06Paper
A general variable neighborhood search variants for the travelling salesman problem with draft limits2017-11-10Paper
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem2017-03-01Paper
Solving a dynamic facility location problem with partial closing and reopening2016-11-17Paper
Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem2016-11-10Paper
A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks2016-10-07Paper
Branch-and-Price for Personalized Multiactivity Tour Scheduling2016-08-12Paper
Modeling and solving a logging camp location problem2015-10-29Paper
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design2015-01-28Paper
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem2015-01-26Paper
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem2014-08-18Paper
A stabilized structured Dantzig-Wolfe decomposition method2013-08-12Paper
A cutting plane algorithm for the capacitated connected facility location problem2013-08-08Paper
Accelerating Benders decomposition with heuristic master problem solutions2013-01-28Paper
Total domination and the Caccetta-Häggkvist conjecture2012-12-28Paper
Grammar-based integer programming models for multi-activity shift scheduling2012-05-13Paper
A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems2012-02-19Paper
Grammar-based integer programming models for multiactivity shift scheduling2011-06-09Paper
Formal languages for integer programming modeling of shift scheduling problems2011-04-06Paper
Benders, metric and cutset inequalities for multicommodity capacitated network design2011-03-24Paper
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs2009-08-13Paper
0-1 reformulations of the multicommodity capacitated network design problem2009-06-23Paper
Modeling the Regular Constraint with Integer Programming2009-03-10Paper
Formulations and relaxations for a multi-echelon capacitated location-distribution problem2008-12-17Paper
On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem2008-09-10Paper
A sequential elimination algorithm for computing bounds on the clique number of a graph2008-08-15Paper
Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation2008-03-17Paper
Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs2008-03-12Paper
On edge orienting methods for graph coloring2007-10-12Paper
A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design2005-04-07Paper
A tabu search heuristic for scheduling the production processes at an oil refinery2004-11-11Paper
A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements2003-11-17Paper
Diversification strategies in local search for a nonbifurcated network loading problem2002-11-20Paper
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design2002-07-30Paper
Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem2002-07-29Paper
A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem2002-06-16Paper
Tabu search for a network loading problem with multiple facilities2001-10-01Paper
A branch-and-bound algorithm for depot location and container fleet management1999-08-05Paper
A parallel branch-and-bound algorithm for multicommodity location with balancing requirements1997-10-26Paper
Parallel Branch-and-Branch Algorithms: Survey and Synthesis1995-05-23Paper
Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements1994-02-17Paper

Research outcomes over time

This page was built for person: Bernard Gendron