The maximum-cut problem is one of the fundamental problems in combinatorial
optimization. With the advent of quantum computers, both the maximum-cut and the …

Abstract While the Maximum Cut Problem and Unconstrained Binary Quadratic Optimization
are of high interest in the scientific community and gain increasing importance, state-of-the …

We present MADAM, a parallel semidefinite-based exact solver for Max-Cut, a problem of
finding the cut with the maximum weight in a given graph. The algorithm uses the branch …

Due to the expected disparity in quantum vs. classical clock speeds, quantum advantage for
branch and bound algorithms is more likely achievable in settings involving large search …

The unconstrained binary quadratic problem is an NP-hard problem and has applications in
many fields. Recently, the problem has attracted much interest in the field of quantum …

A maximum cut (Max-Cut) problem in graph theory is NP-hard. This paper proposes a new
randomized algorithm for finding local Max-Cut in graphs by using fuzzy logic. This paper …

Computing the edge expansion of a graph is a famously hard combinatorial problem for
which there have been many approximation studies. We present two variants of exact …

In this paper, we analyze a new variant of the well-known NP-hard Set Covering Problem,
characterized by pairwise conflicts among subsets of items. Two subsets in conflict can …

We present a computational study of SDP-based bounds for Max-Cut that use a subset of
hypermetric inequalities as cutting planes to strengthen the basic relaxation. Solving these …

Given an undirected graph, the stable set problem asks to determine the cardinality of the
largest subset of pairwise non-adjacent vertices. This value is called the stability number of …