Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement (Q511686)
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: Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement |
scientific article; zbMATH DE number 6687841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement |
scientific article; zbMATH DE number 6687841 |
Statements
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement (English)
0 references
22 February 2017
0 references
regular simplex
0 references
longest edge bisection
0 references
branch-and-bound
0 references
bisection sequence
0 references
combinatorial optimization
0 references
0 references
0.8376261591911316
0 references
0.7297313213348389
0 references
0.6881649494171143
0 references
0.6601343750953674
0 references
