[HTML][HTML] Pseudo-boolean optimization
E Boros, PL Hammer - Discrete applied mathematics, 2002 - Elsevier
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 …
optimization, ie to the optimization of set functions represented by closed algebraic …
[BOOK][B] Boolean functions: Theory, algorithms, and applications
Y Crama, PL Hammer - 2011 - books.google.com
Written by prominent experts in the field, this monograph provides the first comprehensive,
unified presentation of the structural, algorithmic and applied aspects of the theory of …
unified presentation of the structural, algorithmic and applied aspects of the theory of …
A recipe for semidefinite relaxation for (0, 1)-quadratic programming: In memory of Svata Poljak
We review various relaxations of (0, 1)-quadratic programming problems. These include
semidefinite programs, parametric trust region problems and concave quadratic …
semidefinite programs, parametric trust region problems and concave quadratic …
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis
The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying
model for representing a wide range of combinatorial optimization problems, and for linking …
model for representing a wide range of combinatorial optimization problems, and for linking …
Logic, optimization, and constraint programming
JN Hooker - INFORMS Journal on Computing, 2002 - pubsonline.informs.org
Because of their complementary strengths, optimization and constraint programming can be
profitably merged. Their integration has been the subject of increasing commercial and …
profitably merged. Their integration has been the subject of increasing commercial and …
The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds
E Boros, PL Hammer - Annals of Operations Research, 1991 - Springer
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 …
that the number of edges having exactly one endpoint in S is as large as possible. In the …
Concave extensions for nonlinear 0–1 maximization problems
Y Crama - Mathematical Programming, 1993 - Springer
A well-known linearization technique for nonlinear 0–1 maximization problems can be
viewed as extending any polynomial in 0–1 variables to a concave function defined on [0, 1] …
viewed as extending any polynomial in 0–1 variables to a concave function defined on [0, 1] …
A decomposition method for quadratic zero-one programming
P Chardaire, A Sutter - Management Science, 1995 - pubsonline.informs.org
This paper proposes a decomposition method to compute a lower bound for unconstrained
quadratic zero-one minimization. First, we show that any quadratic function can be …
quadratic zero-one minimization. First, we show that any quadratic function can be …
Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
The quadratic unconstrained binary optimization (QUBO) problem arises in diverse
optimization applications ranging from Ising spin problems to classical problems in graph …
optimization applications ranging from Ising spin problems to classical problems in graph …
An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs
This paper addresses a new continuous approach based on the DC (Difference of Convex
functions) programming and DC algorithms (DCA) to Binary quadratic programs (BQP) …
functions) programming and DC algorithms (DCA) to Binary quadratic programs (BQP) …