On refinement of the unit simplex using regular simplices

DOI10.1007/s10898-015-0363-7zbMath1332.90352OpenAlexW1772722273MaRDI QIDQ5964244

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

Publication date: 29 February 2016

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

Full work available at URL: https://doi.org/10.1007/s10898-015-0363-7

zbMATH Keywords

partitioncoveringbranch and boundunit simplex

Mathematics Subject Classification ID

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

Related Items (2)

(Global) optimization: historical notes and recent developments ⋮ Stable subdivision of 4D polytopes

Cites Work

• Unnamed Item
• On determining the cover of a simplex by spheres centered at its vertices
• The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey
• Bisecton by global optimization revisited
• Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
• Red refinements of simplices into congruent subsimplices
• On the exhaustivity of simplicial partitioning
• Simplicial Global Optimization
• On generalized bisection of 𝑛-simplices

This page was built for publication: On refinement of the unit simplex using regular simplices