The incorporation of cutting planes within the branch-and-bound algorithm, known as
branch-and-cut, forms the backbone of modern integer programming solvers. These solvers …

Cutting planes and branching are two of the most important algorithms for solving mixed-
integer linear programs. For both algorithms, disjunctions play an important role, being used …

Solving combinatorial optimization problems involves a two-stage process that follows the
model-and-run approach. First, a user is responsible for formulating the problem at hand as …

Data-driven algorithm design is a paradigm that uses statistical and machine learning
techniques to select from a class of algorithms for a computational problem an algorithm that …

We propose a new method to accelerate online Mixed Integer Optimization with Pre-trained
machine learning models (PreMIO). The key component of PreMIO is a multi-variable …

Greedy best-first search (GBFS) and A* search (A*) are popular algorithms for path-finding
on large graphs. Both use so-called heuristic functions, which estimate how close a vertex is …

Decision trees are a popular tool in machine learning and yield easy-to-understand models.
Several techniques have been proposed in the literature for learning a decision tree …

The current cut selection algorithm used in mixed-integer programming solvers has
remained largely unchanged since its creation. In this paper, we propose a set of new cut …

Learning sketching matrices for fast and accurate low-rank approximation (LRA) has gained
increasing attention. Recently, Bartlett, Indyk, and Wagner (COLT 2022) presented a …

The branch-and-cut algorithm is the method of choice to solve large scale integer
programming problems in practice. A key ingredient of branch-and-cut is the use of cutting …