Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement (Q511686)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement |
scientific article |
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
