Pages that link to "Item:Q1774576"
From MaRDI portal
The following pages link to Efficient algorithms for the smallest enclosing ball problem (Q1774576):
Displaying 15 items.
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems (Q274096) (← links)
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) (Q301399) (← links)
- Minimal containment under homothetics: a simple cutting plane approach (Q535290) (← links)
- A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) (Q833570) (← links)
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls (Q946350) (← links)
- A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\) (Q1941021) (← links)
- A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498) (← links)
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem (Q2157894) (← links)
- Optimal control of hybrid manufacturing systems by log-exponential smoothing aggregation (Q2182812) (← links)
- Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
- An efficient algorithm for the smallest enclosing ball problem in high dimensions (Q2369067) (← links)
- On the planar piecewise quadratic 1-center problem (Q2379920) (← links)
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)
- A reformulation-linearization based algorithm for the smallest enclosing circle problem (Q2666744) (← links)
- The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\) (Q6103201) (← links)
