We introduce a new branch-and-bound Max-SAT solver, Clone, which employs a novel approach for computing lower bounds. This approach allows Clone to search in a reduced space. Moreover, Clone is equipped with novel techniques for learning from soft conflicts. Experimental results show that Clone performs competitively with the leading Max-SAT solver in the broadest category of this year’s Max-SA...

An addition sequence problem is given a set of numbers X = {n1, n2, · · · , nm}, what is the minimal number of additions needed to compute all m numbers starting from 1? Downey et al. [9] showed that the addition sequence problem is NPcomplete. This problem has application in evaluating the monomials y1 , y2 , · · · , ym . In this paper, we present an algorithm to generate an addition sequence ...

In this paper we present a classification of parallel branch and bound algorithms, and elaborate on the consequences of particular parameter settings. The taxonomy is based upon how the algorithms handle the knowledge about the problem instance to be solved, generated during execution. The starting point of the taxonomy is the generally accepted description of the sequential branch and bound al...

The Molecular Distance Geometry Problem (MDGP) is the problem of finding the conformation of a molecule from inter-atomic distances. In some recent work, we proposed the interval Branch & Prune (iBP) algorithm for solving instances of the MDGP related to protein backbones. This algorithm is based on an artificial ordering given to the atoms of the protein backbones which allows the discretizati...

The solution of convex Mixed Integer Quadratic Programming (MIQP) problems with a general branch{and{bound framework is considered. It is shown how lower bounds can be computed eeciently during the branch{and{bound process. Improved lower bounds such as the ones derived in this paper can reduce the number of QP problems that have to be solved. The branch{and{bound approach is also shown to be s...

Motivation: We developed an algorithm to reconstruct ancestral sequences, taking into

This article presents the preliminary results on a new branch-and-bound algorithm proposed for the single machine total tardiness problem with arbitrary release dates. The algorithm relies on dominance properties from the literature as well as a new branching condition. A new lower bounding technique for the problem is also introduced. The performance of the algorithm is compared to the perform...

Single round robin tournaments are a well-known class of sports leagues schedules. We consider leagues with a set T of n teams where n is even. Costs are associated with each possible match. Moreover, stadium availability, fixed matches, and regions’ capacities are taken into account. The goal is to find the minimum cost tournament among those having the minimum number of breaks and being feasi...

We present a Branch and Bound approach for the resource constrained project scheduling problem where activity durations are assumed to be random according to independent probability distributions. Our aim is to compute an optimal scheduling policy that minimize the expected project cost with respect to some regular measure of performance.