We present an application of the MaxCut problem in statistical physics. We design a branch-and-bound algorithm for MaxCut and use it to nd all ground states in three dimensional 5 5 5 Ising spin glass systems.

In this paper, we present an access method called branch index for query processing of the aggregation hierarchy as a tree in object-oriented databases. The algorithm of branch generation will be proposed to generate all branches for the tree aggregation of classes in the database. For each branch, the information of linking objects is stored so that class traversal methods can be eliminated. U...

The classical branch-and-bound algorithm for the integer feasibility problem Find x ∈ Q ∩ Zn, with Q = {

WCSP is a soft constraint framework with a wide range of applications. Most current complete solvers can be described as a depthfirst branch and bound search that maintain some form of local consistency during the search. However, the known consistencies are unable to solve problems with huge domains because of their time and space complexities. In this paper, we adapt a weaker form of arc cons...

We describe a new method for estimating the evolutionary tree linking a collection of species from their aligned four-state genetic sequences. This method, which can be adapted to provide a branch-and-bound algorithm, is statistically consistent provided the sequences have evolved according to a standard stochastic model of nucleotide mutation. Our approach exploits a recent grouptheoretic desc...

The Data Correcting Algorithm is a branch and bound algorithm in which the data of a given problem instance is ‘corrected’ at each branching in such a way that the new instance will be as close as possible to a polynomially solvable instance and the result satisfies an acceptable accuracy (the difference between optimal and current solution). In this paper the data correcting algorithm is appli...

Stereo correspondence is hard because di erent image features can look alike. We propose a measure for the ambiguity of image points that allows matching distinctive points rst and breaks down the matching task into smaller and separate subproblems. Experiments with a branch-and-bound algorithm based on this measure demonstrate the ensuing e ciency and low likelihood of incorrect matches. Categ...