State-Space Search: Algorithms, Complexity, Extensions, and Applications

This book is about problem solving. Specifically, it is about heuristic state-space search under branch-and-bound framework for solving combinatorial optimization problems. The two central themes of this book are the average-case complexity of heuristic state-space search algorithms based on branch-and-bound, and their applications to developing new problem-solving methods and algorithms. Heuristic state-space search is one of the fundamental problem-solving techniques in Computer Science a...