Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement (Q511686): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59603002, #quickstatements; #temporary_batch_1711439739529 |
Created claim: DBLP publication ID (P1635): journals/jco/SalmeronACGHG17, #quickstatements; #temporary_batch_1731547958265 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: On the Bisection Method for Triangles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4639655 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On generalized bisection of 𝑛-simplices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A comparison of adaptive refinement techniques for elliptic problems / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jco/SalmeronACGHG17 / rank | |||
Normal rank | |||
Latest revision as of 02:36, 14 November 2024
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
