activity
20072024
most citedA polynomial size model with implicit SWAP gate counting for exact qubit reordering

1 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing math.OCShow all

2 papers · 1 filter

math.OC2024★ 1 cited

Learning optimal objective values for MILP

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. In recent years…

math.OC2024

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming

Lara Scavuzzo, Karen Aardal, Andrea Lodi +1

Mixed Integer Linear Programming (MILP) is a pillar of mathematical optimization that offers a powerful modeling language for a wide range of applications. During the past decades,…