The branch-and-bound (B&B) algorithmic framework has been used successfully to find
exact solutions for a wide array of optimization problems. B&B uses a tree search strategy to …

A wide range of problems arising in practical applications can be formulated as Mixed-
Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint …

Bound propagation methods, when combined with branch and bound, are among the most
effective methods to formally verify properties of deep neural networks such as correctness …

Phase retrieval seeks to recover a signal x ∈ C^ px∈ C p from the amplitude| A x|| A x| of
linear measurements Ax ∈ C^ n A x∈ C n. We cast the phase retrieval problem as a non …

The formalism of probabilistic graphical models provides a unifying framework for capturing
complex dependencies among random variables, and building large-scale multivariate …

“Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic,
applied areas such as planning, scheduling, operations research and combinatorial …

We present randomized approximation algorithms for the maximum cut (MAX CUT) and
maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected …

In semidefinite programming, one minimizes a linear function subject to the constraint that
an affine combination of symmetric matrices is positive semidefinite. Such a constraint is …

Although this may seem a paradox, all exact science is dominated by the idea of
approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including …

A PRACTICAL GUIDE TO OPTIMIZATION PROBLEMS WITH DISCRETE OR INTEGER
VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming …