Design and Implementation of an Heuristic-Enhanced Branch-and-Bound Solver for MILP

no code implementations • 4 Jun 2022 • Warley Almeida Silva, Federico Bobbio, Flore Caye, Defeng Liu, Justine Pepin, Carl Perreault-Lafleur, William St-Arnaud

Our Branch-and-Bound algorithm is effective on a small portion of the training data set, and it manages to find an incumbent feasible solution for an instance that we could not solve with the Diving heuristics.

The First AI4TSP Competition: Learning to Solve Stochastic Routing Problems

1 code implementation • 25 Jan 2022 • Laurens Bliek, Paulo da Costa, Reza Refaei Afshar, Yingqian Zhang, Tom Catshoek, Daniël Vos, Sicco Verwer, Fynn Schmitt-Ulms, André Hottung, Tapan Shah, Meinolf Sellmann, Kevin Tierney, Carl Perreault-Lafleur, Caroline Leboeuf, Federico Bobbio, Justine Pepin, Warley Almeida Silva, Ricardo Gama, Hugo L. Fernandes, Martin Zaefferer, Manuel López-Ibáñez, Ekhine Irurozki

Overall, by organizing this competition we have introduced routing problems as an interesting problem setting for AI researchers.

Combinatorial Optimization Traveling Salesman Problem

An Empirical Analysis of Visual Features for Multiple Object Tracking in Urban Scenes

1 code implementation • 15 Oct 2020 • Mehdi Miah, Justine Pepin, Nicolas Saunier, Guillaume-Alexandre Bilodeau

Commonly used features are color histograms, histograms of oriented gradients, deep features from convolutional neural networks and re-identification (ReID) features.

Multiple Object Tracking