Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given se...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | , , , |
| Format: | Electronic Book |
| Language: | English |
| Published: |
Cham :
Springer International Publishing : Imprint: Springer,
2019
|
| Series: | Intelligent Systems Reference Library,
146 |
| Subjects: |
Table of Contents:
- 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