Leandro C. Coelho
RetourPublications
Cahiers du GERAD
Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagram
The Quadratic Knapsack Problem (QKP) is a challenging combinatorial optimization problem that has attracted significant attention due to its complexity and p...
référence BibTeX
The cubic knapsack problem (CKP) is a combinatorial optimization problem, which can be seen both as a generalization of the quadratic knapsack problem (QKP) ...
référence BibTeX
Vehicle routing problems (VRPs) with deadlines have received significant attention around the world. Motivated by a real-world food delivery problem, we assu...
référence BibTeX
The Quadratic Knapsack Problem (QKP) is a combinatorial optimization problem that has attracted much attention over the past four decades. In this problem, o...
référence BibTeX
This paper studies the Dynamic Facility Location Problem with Modular Capacities (DFLPM). We propose a linear relaxation based heuristic (LRH) and an evoluti...
référence BibTeX
The inventory-routing problem (IRP) integrates two well-studied problems, namely, inventory management and vehicle routing. Given a set of customers to servi...
référence BibTeX