Pages that link to "Item:Q2358480"
From MaRDI portal
The following pages link to An efficient cutting plane algorithm for the smallest enclosing circle problem (Q2358480):
Displaying 6 items.
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems (Q274096) (← links)
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems (Q328518) (← links)
- A reformulation-linearization based algorithm for the smallest enclosing circle problem (Q2666744) (← links)
- Rounding algorithms for a geometric embedding of minimum multiway cut (Q2819596) (← links)
- On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost (Q3404452) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901266) (← links)