Enumerative approaches to combinatorial optimization-Part I

Combinatorial Optimization Problems and their complexity are discussed including consideration of NP-completeness. Branch-and-bound Algorithms are then studied in detail. Examples are given for typical combinatorial optimization problems. A chapter is devoted to exploring how the different constituent parts of a branch-and-bound algorithm affect different aspects of the performance of the algorithm. Theoretical results for the performance of branch-and-bound algorithms are also presented. [See next abstract.]