36 citations · 143 across the 10 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.LG2022★ 3 cited
Machine Learning for Combinatorial Optimisation of Partially-Specified Problems: Regret Minimisation as a Unifying Lens
Stefano Teso, Laurens Bliek, Andrea Borghesi +4
It is increasingly common to solve combinatorial optimisation problems that are partially-specified. We survey the case where the objective function or the relations between variab…
cs.LG2022★ 18 cited
Learning to branch with Tree MDPs
Lara Scavuzzo, Feng Yang Chen, Didier Chételat +4
State-of-the-art Mixed Integer Linear Program (MILP) solvers combine systematic tree search with a plethora of hard-coded heuristics, such as the branching rule. The idea of learni…