We are happy to announce that Najib Errami has joined our team as an engineer. Najib will work on the project ADLib which aims to create a library for Aggregation/Disaggregation of large network flow models.
Authors: Najib Errami, Eduardo Queiroga, Ruslan Sadykov, Eduardo Uchoa
Abstract: The optimization community has made significant progress in solving Vehicle Routing Problems (VRPs) to optimality using sophisticated Branch-Cut-and-Price (BCP) algorithms. VRPSolver is a BCP algorithm with excellent performance in many VRP variants. [Read more]
Abstract: The optimization community has made significant progress in solving Vehicle Routing Problems (VRPs) to optimality using sophisticated Branch-Cut-and-Price (BCP) algorithms. VRPSolver is a BCP algorithm with excellent performance in many VRP variants. [Read more]
We consider general aggregation/disaggregation techniques to address optimization problems that are expressed with the help of sequential decision processes. Our main goals are threefold: a generic formalism that encompasses the aforementioned techniques ; more efficient algorithms to control the aggregation procedures ; open-source codes that leverage and integrate these algorithms to efficiently solve hard combinatorial problems in different application fields.
[Read more]
[Read more]