Pages that link to "Item:Q1317311"
From MaRDI portal
The following pages link to An algorithm for finding the Chebyshev center of a convex polyhedron (Q1317311):
Displaying 12 items.
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) (Q301399) (← links)
- Extremal problems for convex curves with a given self Chebyshev radius (Q2038640) (← links)
- Chebyshev center and inscribed balls: properties and calculations (Q2080823) (← links)
- Covering a set by a convex compactum: error estimates and computation (Q2090531) (← links)
- CONSTRAINED OPTIMAL LOCATION (Q2748922) (← links)
- (Q3391378) (← links)
- A farthest-point characterisation of the relative Chebyshev centre (Q4346956) (← links)
- On the elimination of inessential points in the smallest enclosing ball problem (Q4622883) (← links)
- A Supervised Learning Approach Involving Active Subspaces for an Efficient Genetic Algorithm in High-Dimensional Optimization Problems (Q5005000) (← links)
- Chebyshev centres, Jung constants, and their applications (Q5220255) (← links)
- Modified gradient sampling algorithm for nonsmooth semi-infinite programming (Q6578198) (← links)
- An algorithm for finding the generalized Chebyshev center of sets defined via their support functions (Q6638636) (← links)
