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 …

In this paper we consider the problem of finding the efficient frontier associated with the
standard mean–variance portfolio optimisation model. We extend the standard model to …

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 …

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 …

Optimal Reliability Design is a detailed introduction to systems reliability and reliability
optimization. State-of-the-art techniques for maximizing system reliability are described …

This paper is concerned with the development of an algorithm to solve continuous
polynomial programming problems for which the objective function and the constraints are …

We generalize the disjunctive approach of Balas, Ceria, and Cornuéjols [2] and devevlop a
branch-and-cut method for solving 0-1 convex programming problems. We show that cuts …

The satis ability (SAT) problem is a core problem in mathematical logic and computing
theory. In practice, SAT is fundamental in solving many problems in automated reasoning …

Because of their complementary strengths, optimization and constraint programming can be
profitably merged. Their integration has been the subject of increasing commercial and …

Combinatorial optimization problems are often too complex to be solved within reasonable
time limits by exact methods, in spite of the theoretical guarantee that such methods will …