In recent years the unconstrained binary quadratic program (UBQP) has grown in
importance in the field of combinatorial optimization due to its application potential and its …

This paper is devoted to a thorough study on convex analysis approach to dc (difference of
convex functions) programming and gives the State of the Art. Main results about dc duality …

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 …

Given a set of entities, Cluster Analysis aims at finding subsets, called clusters, which are
homogeneous and/or well separated. As many types of clustering and criteria for …

State-of-the-art research on MRFs, successful MRF applications, and advanced topics for
future study. This volume demonstrates the power of the Markov random field (MRF) in …

We study unconstrained quadratic zero–one programming problems having n variables from
a polyhedral point of view by considering the Boolean quadric polytope QP n in n (n+ 1)/2 …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

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 …

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 …

Let $$(MQP) $$ be a general mixed-integer quadratic program that consists of minimizing a
quadratic function $$ f (x)= x^ TQx+ c^ Tx $$ subject to linear constraints. Our approach to …