Name: Isaac Balster
Type: User
Company: Inria - inria.fr
Bio: PhD student at Université de Bordeaux (IMB - Inria) with an MSc in Transport Engineering from Coppe/UFRJ. Development of exact and heuristic MILP algorithms.
Location: Bordeaux, France
Blog: https://www.linkedin.com/in/isaacbalster
Isaac Balster's Projects
A greedy heuristic for the knapsack problem.
Open-source, state-of-the-art VRP solver in an easy-to-use Python package.
Slack Induction by String Removals for Vehicle Routing Problems ( https://doi.org/10.1287/trsc.2019.0914 )
Models and cut separation callbacks (fractional and integer solutions) for the traveling salesman problem - TSP.