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 …

We present an improved algorithm for finding exact solutions to Max-Cut and the related
binary quadratic programming problem, both classic problems of combinatorial optimization …

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 …

In this paper we present a method for finding exact solutions of the Max-Cut problem max x T
Lx such that x∈{− 1, 1} n. We use a semidefinite relaxation combined with triangle …

The theta bodies of a polynomial ideal are a series of semidefinite programming relaxations
of the convex hull of the real variety of the ideal. In this paper we construct the theta bodies …

A common approach to solve or find bounds of polynomial optimization problems like Max-
Cut is to use the first level of the Lasserre hierarchy. Higher levels of the Lasserre hierarchy …

The spectra of spin models have been investigated in computation experiments. For the
Sherrington-Kirkpatrick and Edwards-Anderson models we have determined the basic …

The max-cut problem is an NP-hard combinatorial optimization problem defined on
undirected weighted graphs. It consists in finding a subset of the graph's nodes such that the …

One usually tries to raise the efficiency of optimization techniques by changing the dynamics
of local optimization. In contrast to the above approach, we propose changing the surface of …

The paper deals with the binary minimization of a quadratic functional. Typically the problem
is NP-hard and the organization of the quadratic functional landscape in space of multiple …