Dynamic programming is an efficient technique for solving optimization problems. and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths.
Introduction.- Tools for Study of Pareto Optimal Points.- Some Tools for Decision Tables.- Different Kinds of Decision Trees.- Multi-stage Optimization of Decision Trees with Some Applications.- More Applications of Multi-stage Optimizationof Decision Trees.- Bi-Criteria Optimization Problem for Decision Trees: Cost vs Cost.- Bi-Criteria Optimization Problem for Decision Trees: Cost vs Uncertainty.- Different Kinds of Rules and Systems of Rules