Login / Signup

Calculating a minimal sphere containing a polytope defined by a system of linear inequalities.

Hiroshi KonnoYasutoshi YajimaAyumi Ban
Published in: Comput. Optim. Appl. (1994)
Keyphrases
  • linear inequalities
  • convex hull
  • linear programming
  • real numbers
  • linear program
  • integer linear programming
  • integer points
  • data sets
  • high dimensional
  • upper bound
  • simulated annealing
  • feasible solution
  • stable set