Random Trees and the Analysis of Branch and Bound Procedures (Q3028342)
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: Publication:3028342 |
scientific article; zbMATH DE number 4016190
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random Trees and the Analysis of Branch and Bound Procedures |
scientific article; zbMATH DE number 4016190 |
Statements
Random Trees and the Analysis of Branch and Bound Procedures (English)
0 references
1984
0 references
discrete optimization
0 references
NP-hard problems
0 references
branch and bound procedures
0 references
relaxation-guided procedures
0 references
average case complexity
0 references
labeled trees
0 references
searching
0 references
search strategies
0 references
traveling salesman problem
0 references
0.7806090116500854
0 references
0.7746305465698242
0 references
0.7744355797767639
0 references
0.7725341320037842
0 references
