Computing upper and lower bounds in interval decision trees (Q877064)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing upper and lower bounds in interval decision trees |
scientific article; zbMATH DE number 5144975
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing upper and lower bounds in interval decision trees |
scientific article; zbMATH DE number 5144975 |
Statements
Computing upper and lower bounds in interval decision trees (English)
0 references
19 April 2007
0 references
decision analysis
0 references
decision trees
0 references
bilinear programming
0 references
multi-linear programming
0 references
0 references
0 references
0 references
0 references
0 references
0.7874554991722107
0 references
0.7583163976669312
0 references
0.7461099624633789
0 references
0.7403472661972046
0 references
0.7398114800453186
0 references
