On the minimum number of simplex shapes in longest edge bisection refinement of a regular n-simplex

MaRDI QIDQ4639655zbMATH OpenFDO

Authors G. Aparicio, E. M. T. Hendrix, Boglárka G.-Tóth, L. G. Casado, I. García

Publication date 11 May 2018

Full work available at URL https://content.iospress.com/articles/informatica/inf1044

zbMATH Keywords

combinatorial optimizationbranch-and-boundregular simplexlongest edge bisectionsimplex shape

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
• On refinement of the unit simplex using regular simplices
• scientific article; zbMATH DE number 6869275
• On generalized bisection of 𝑛-simplices
• BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION

Cited in

(5)

• A weak compatibility condition for newest vertex bisection in any dimension
• Globally maximizing the sum of squares of quadratic forms over the unit sphere
• On refinement of the unit simplex using regular simplices
• On dealing with minima at the border of a simplicial feasible area in simplicial branch and bound
• Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement

This page was built for publication: On the minimum number of simplex shapes in longest edge bisection refinement of a regular \(n\)-simplex

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