Pages that link to "Item:Q2044498"
From MaRDI portal
The following pages link to A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498):
Displaying 6 items.
- A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) (Q833570) (← links)
- Efficient algorithms for the smallest enclosing ball problem (Q1774576) (← links)
- An efficient cutting plane algorithm for the smallest enclosing circle problem (Q2358480) (← links)
- An efficient algorithm for the smallest enclosing ball problem in high dimensions (Q2369067) (← links)
- The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\) (Q6103201) (← links)
- The weighted Euclidean one-center problem in \(\mathbb{R}^n\) (Q6624439) (← links)