Combinatorial Optimization and Applications : A Tribute to Bernard Gendron

Bernard Gendron and Operations Research -- Methodological Developments -- Variable Neighbourhood Search with Dynamic Exploration for the Set Union Knapsack Problem -- Common-Flow Formulations for the Diameter Constrained Spanning Tree Problem -- Models and Methods for Two-Level Uncapacitated Facility Location Problem -- Facility Location: A Guide to Modeling and Solving Complex Problem Variants via Lagrangian Relaxation -- Bin Packing Problems for Capacity Planning and Last Mile Applications -- Models for Network Flow and Network Design Problems with Piecewise Linear Costs -- New Formulations for the Scheduled Service Network Design Problem with Piecewise Linear Costs -- Multi-layer Network Design for Consolidation-based Transportation Planning -- Separable Lagrangian Decomposition for Quasi-Separable Problems -- Decomposition-based Algorithms for Mixed-Integer Linear Programs with Integer Subproblems -- Perspectives on Using Benders Decomposition to Solve Two-Stage Stochastic Mixed-Integer Programs -- Decomposition Methods for Choice-Based Optimization Models -- Application-oriented Developments -- The Static Elevator Dispatching Problem with Destination Control -- Flow-based Robustness in Consistent Home Care Service Delivery -- Production Inventory Technician Routing Problem: a Bi-Objective Post-Sales Application -- Express Package Delivery Optimization Using Walkers, Cargo Tricycles and Delivery Trucks -- Integrated Location, Sizing, and Pricing for EV Charging Stations.