Pages that link to "Item:Q2369067"
From MaRDI portal
The following pages link to An efficient algorithm for the smallest enclosing ball problem in high dimensions (Q2369067):
Displayed 4 items.
- A smoothing trust-region Newton-CG method for minimax problem (Q928081) (← 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)
- A new algorithm for the minimax location problem with the closest distance (Q6092935) (← links)