Enumerative approaches to combinatorial optimization-Part II

In this second part dynamic programming algorithms are discussed. The relationship between dynamic programming and branch-and-bound algorithms is explored. Successive sublimation methods for dynamic programming computation are described and examples given of its application. General strategies for designing heuristic algorithms are surveyed, and particular consideration is given to the use of branch-and-bound algorithms for approximation purposes. Approximation schemes are also discussed. The final chapter discusses the implementation of branch-and-bound algorithms and typical programs of depth-first search and heuristic search are coded in PASCAL. Concurrent or parallel execution of branch-and-bound algorithms is also discussed. [See previous abstract.]