GRIBB - Branch-and-Bound methods on the Internet

The GRIBB project (GReat International Branch-and-Bound search) is seeking to establish a software library for solving a large class of parallel search problems by the use of numerous computers around the world accessed by Internet. GRIBB is a lean JAVA-based software package targeting compute intensive combinatorial optimization problems solved by the use of branch-and-bound methods. The Quadratic Assignment Problem has been chosen as the first major test application due to its high computation complexity, and preliminary results from test runs are presented.