We present a detailed and up-to-date survey of the literature on parallel branch-and-bound
algorithms. We synthesize previous work in this area and propose a new classification of …

Load Balancing in Parallel Computers: Theory and Practice is about the essential software
technique of load balancing in distributed memory message-passing parallel computers …

In this chapter, we provide an overview of the current state of the art with respect to solution
of mixed integer linear optimization problems (MILPs) in parallel. Sequential algorithms for …

Discrete optimization problems (DOPs) arise in various applications such as planning,
scheduling, computer aided design, robotics, game playing and constraint directed …

This work studies how grid and cloud computing can be applied to efficiently solving
propositional satisfiability problem (SAT) instances. Propositional logic provides a …

Many real-world problems in different industrial and economic fields are permutation
combinatorial optimization problems. Solving to optimality large instances of these …

In this paper, we describe the first parallel Branch-and-Bound (B&B) algorithm with a history-
based domination technique. Although history-based domination substantially speeds up a …

Many of the artificial intelligence techniques developed to date rely on heuristic search
through large spaces. Unfortunately, the size of these spaces and the corresponding …

Static load balancing is attractive due to its simplicity and low communication costs. We
analyze under which circumstances a randomized static load balancer can achieve good …

Abstract Satisfiability Modulo Theories (SMT) is an extension of the propositional
satisfiability problem (SAT) to other, well-chosen (first-order) theories such as integers, reals …