Fast Matrix Multiplication Without Tears: A Constraint Programming Approach

1 code implementation • 1 Jun 2023 • Arnaud Deza, Chang Liu, Pashootan Vaezipoor, Elias B. Khalil

In this work, we propose a simple yet novel Constraint Programming approach to find non-commutative algorithms for fast matrix multiplication or provide proof of infeasibility otherwise.

Problem Decomposition valid

Machine Learning for Cutting Planes in Integer Programming: A Survey

no code implementations • 17 Feb 2023 • Arnaud Deza, Elias B. Khalil

We survey recent work on machine learning (ML) techniques for selecting cutting planes (or cuts) in mixed-integer linear programming (MILP).