On the minimum number of simplex shapes in longest edge bisection refinement of a regular \(n\)-simplex (Q4639655)
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: On the minimum number of simplex shapes in longest edge bisection refinement of a regular n-simplex |
scientific article; zbMATH DE number 6867717
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the minimum number of simplex shapes in longest edge bisection refinement of a regular \(n\)-simplex |
scientific article; zbMATH DE number 6867717 |
Statements
11 May 2018
0 references
regular simplex
0 references
longest edge bisection
0 references
branch-and-bound
0 references
combinatorial optimization
0 references
simplex shape
0 references
0.8376261591911316
0 references
0.8129432797431946
0 references
0.7390827536582947
0 references
0.7177422046661377
0 references
