Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

摘要

In contrast with conventional dynamic programming algorithms that return one solution, extensions of dynamic programming allows us to work with the whole set of solutions or its essential part, to perform multi-stage optimization relative to different criteria, to count the number of solutions, and to find the set of Pareto optimal points for bi-criteria optimization problems. The presentation is based on the results considered in three books published or accepted by Springer.