Solving discrete minimax problems using interval arithmetic (Q5488947)
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: Solving discrete minimax problems using interval arithmetic |
scientific article; zbMATH DE number 5056697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving discrete minimax problems using interval arithmetic |
scientific article; zbMATH DE number 5056697 |
Statements
25 September 2006
0 references
maximum entropy
0 references
linear pruning steps
0 references
branch-and-prune
0 references
0.880661129951477
0 references
0.8133219480514526
0 references
0.8115957975387573
0 references
