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

DOI10.1007/S10878-015-9970-YzbMATH Open1361.90054DBLPjournals/jco/SalmeronACGHG17OpenAlexW2255287242WikidataQ59603002 ScholiaQ59603002MaRDI QIDQ511686FDOQ511686

E. M. T. Hendrix, G. Aparicio, José M. G. Salmerón, Boglárka G.-Tóth, L. G. Casado, I. 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)

Cites Work

• Title not available (Why is that?)
• On the Bisection Method for Triangles
• On generalized bisection of 𝑛-simplices
• A comparison of adaptive refinement techniques for elliptic problems

Cited In (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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511686)