Search Results for author: Lara Scavuzzo

Found 5 papers, 4 papers with code

Learning optimal objective values for MILP

1 code implementation27 Nov 2024 Lara Scavuzzo, Karen Aardal, Neil Yorke-Smith

Modern Mixed Integer Linear Programming (MILP) solvers use the Branch-and-Bound algorithm together with a plethora of auxiliary components that speed up the search.

Decision Making Graph Neural Network

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming

no code implementations8 Feb 2024 Lara Scavuzzo, Karen Aardal, Andrea Lodi, Neil Yorke-Smith

We also address how to represent MILPs in the context of applying learning algorithms, MILP benchmarks and software.

Learning to branch with Tree MDPs

1 code implementation23 May 2022 Lara Scavuzzo, Feng Yang Chen, Didier Chételat, Maxime Gasse, Andrea Lodi, Neil Yorke-Smith, Karen Aardal

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.

Reinforcement Learning (RL)

Cannot find the paper you are looking for? You can Submit a new open access paper.