1 citations · 3 across the 5 of their papers we have counts for
5 papers
Stable Matching with Contingent Priorities
Ignacio Rios, Federico Bobbio, Margarida Carvalho +1
Using school choice as a motivating example, we introduce a stylized model of a many-to-one matching market where the clearinghouse aims to implement contingent priorities, i.e., p…
Design and Implementation of an Heuristic-Enhanced Branch-and-Bound Solver for MILP
Warley Almeida Silva, Federico Bobbio, Flore Caye +4
We present a solver for Mixed Integer Programs (MIP) developed for the MIP competition 2022. Given the 10 minutes bound on the computational time established by the rules of the co…
Capacity Variation in the Many-to-one Stable Matching
Federico Bobbio, Margarida Carvalho, Andrea Lodi +1
The many-to-one stable matching problem provides the fundamental abstraction of several real-world matching markets such as school choice and hospital-resident allocation. The agen…
The First AI4TSP Competition: Learning to Solve Stochastic Routing Problems
Laurens Bliek, Paulo da Costa, Reza Refaei Afshar +19
This paper reports on the first international competition on AI for the traveling salesman problem (TSP) at the International Joint Conference on Artificial Intelligence 2021 (IJCA…
Capacity Planning in Stable Matching
Federico Bobbio, Margarida Carvalho, Andrea Lodi +2
Motivated by the shortage of seats that the Chilean school choice system is facing, we introduce the problem of jointly increasing school capacities and finding a student-optimal a…