Pages that link to "Item:Q511686"
From MaRDI portal
The following pages link to Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement (Q511686):
Displaying 4 items.
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic (Q2046307) (← links)
- Globally maximizing the sum of squares of quadratic forms over the unit sphere (Q2228375) (← links)
- Properties of the multidimensional finite elements (Q2661053) (← links)
- On refinement of the unit simplex using regular simplices (Q5964244) (← links)