Cuts and metrics are well-known objects that arise-independently, but with many deep and
fascinating connections-in diverse fields: in graph theory, combinatorial optimization …

This survey examines the state of the art of a variety of problems related to pseudo-Boolean
optimization, ie to the optimization of set functions represented by closed algebraic …

The first systematic overviews on global optimization appeared in 1975–1978 thanks to two
fundamental volumes titled Towards Global Optimization (Dixon & Szegö, 1975, 1978). At …

We present computational experiments for solving quadratic (0, 1) problems. Our approach
combines a semidefinite relaxation with a cutting plane technique, and is applied in a …

Given a graph G, the maximum cut problem consists of finding the subset S of vertices such
that the number of edges having exactly one endpoint in S is as large as possible. In the …

Nonconvex quadratic programming with box constraints is a fundamental NP-hard global
optimization problem. Recently, some authors have studied a certain family of convex sets …

We present effective linear programming based computational techniques for solving
nonconvex quadratic programs with box constraints (BoxQP). We first observe that known …

Location, scheduling and design problems are assignment type problems with quadratic
cost functions and occur in many contexts stretching from spatial economics via plant and …

We study the polyhedral convex hull of a mixed-integer set 𝒮 defined by a collection of
multilinear equations over the unit hypercube. Such sets appear frequently in the factorable …

This paper develops a correspondence relating convex hulls of fractional functions with
those of polynomial functions over the same domain. Using this result, we develop a number …