scientific article; zbMATH DE number 6867717

zbMath1387.90275MaRDI QIDQ4639655

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

Publication date: 11 May 2018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items (4)

A Weak Compatibility Condition for Newest Vertex Bisection in Any Dimension ⋮ Globally maximizing the sum of squares of quadratic forms over the unit sphere ⋮ 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

This page was built for publication: