We present a method for finding exact solutions of Max-Cut, the problem of finding a cut of
maximum weight in a weighted graph. We use a Branch-and-Bound setting that applies a …

Research efforts of the past fifty years have led to a development of linear integer
programming as a mature discipline of mathematical optimization. Such a level of maturity …

Ising machines based on nonlinear analog systems are a promising method to accelerate
computation of NP-hard optimization problems. Yet, their analog nature is also causing …

A common way to produce a convex relaxation of a Mixed Integer Quadratically Constrained
Program (MIQCP) is to lift the problem into a higher-dimensional space by introducing …

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 …

Biq Mac Library - A collection of Max-Cut and quadratic 0-1 programming instances of medium
size Page 1 Biq Mac Library - A collection of Max-Cut and quadratic 0-1 programming …

Optimization problems, particularly NP-Hard Combinatorial Optimization problems, are
some of the hardest computing problems with no known polynomial time algorithm existing …

The quadratic linear ordering problem naturally generalizes various optimization problems
such as bipartite crossing minimization or the betweenness problem, which includes linear …

The minimum k-partition (M k P) problem is the problem of partitioning the set of vertices of a
graph into k disjoint subsets so as to minimize the total weight of the edges joining vertices …

Let G be an undirected graph for which the standard Max-Cut SDP relaxation achieves at
least ac fraction of the total edge weight, 1/2≤ c≤ 1. If the actual optimal cut for G is at most …