This chapter presents implementation details of B&BT algorithms. We consider several tools and features: data structures, memory management and, most notably, parallelization. Both shared-memory and distributed-memory environments are considered. Issues of both cases are discussed. Promising future directions are outlined, also.
Bartlomiej Kubica hasn't uploaded this paper.
Let Bartlomiej know you want this paper to be uploaded.
