Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search (Q3686029)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search |
scientific article |
Statements
Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search (English)
0 references
1985
0 references
combinatorially large problem space
0 references
approximate stochastic model
0 references
average memory space
0 references
subproblems
0 references
depth-first search
0 references
