Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement

DOI10.1007/s10878-015-9970-yzbMath1361.90054OpenAlexW2255287242WikidataQ59603002 ScholiaQ59603002MaRDI QIDQ511686

G. Aparicio, Eligius M. T. Hendrix, José M. G. Salmerón, Boglárka G.-Tóth, Leocadio G. Casado, Inmaculada F. García

Publication date: 22 February 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9970-y

zbMATH Keywords

combinatorial optimizationbranch-and-boundregular simplexlongest edge bisectionbisection sequence

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

Properties of the multidimensional finite elements ⋮ Globally maximizing the sum of squares of quadratic forms over the unit sphere ⋮ On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic

Cites Work

• Unnamed Item
• On generalized bisection of 𝑛-simplices
• On the Bisection Method for Triangles
• A comparison of adaptive refinement techniques for elliptic problems

This page was built for publication: Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement