Branch-and-Bound Applications in Combinatorial Data Analysis

Abstract

Reviews the book, Branch-and-bound applications in combinatorial data analysis by M. J. Brusco and S. Stahl (2005). This excellent monograph on applications of branch-and-bound algorithms in combinatorial data analysis fills a long neglected gap in the quantitative psychology literature, and will prove an indispensable companion to any researcher having serious interest in advanced techniques for seriation/scaling and nonhierarchical clustering. This monograph is organized into three main sections covering nonhierarchical set partitioning, object seriation/scaling, and variable selection in multiple regression and K-means clustering. The presentation of the material follows a common structure: an introductory chapter provides a general description of the essential requirements to be met by a branch-and-bound application to the particular technique. This book is written in a very accessible manner, with only moderate mathematical prerequisites. (PsycINFO Database Record (c) 2012 APA, all rights reserved)