Theoretical comparisons of search strategies in branch-and-bound algorithms (Q4192964)
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: Theoretical comparisons of search strategies in branch-and-bound algorithms |
scientific article; zbMATH DE number 3631926
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Theoretical comparisons of search strategies in branch-and-bound algorithms |
scientific article; zbMATH DE number 3631926 |
Statements
Theoretical comparisons of search strategies in branch-and-bound algorithms (English)
0 references
1976
0 references
Branch-And-Bound Algorithm
0 references
Heuristic Search
0 references
Computational Complexity
0 references
Mathematical Programming
0 references
0 references
