Calculating a minimal sphere containing a polytope defined by a system of linear inequalities-Reference-Cited by-同舟云学术

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

Published:1994-05 Issue:2 Volume:3 Page:181-191
ISSN:0926-6003
Container-title:Computational Optimization and Applications
language:en
Short-container-title:Comput Optim Applic

Author:

Konno Hiroshi,Yajima Yasutoshi,Ban Ayumi

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Control and Optimization

Link

http://link.springer.com/content/pdf/10.1007/BF01300973.pdf

Reference21 articles.

1. E. Balas and C.A. Burdet (1973), ?Maximizing a Convex Quadratic Functions Subject to Linear Constraints,? MSRR 299 GSIA, Carnegie-mellon University.

2. M.E. Dyer (1986), ?On a Multidimensional Search Technique and its Applications to the Euclidean One-center Problem,?SIAM Journal on Computing,15, 725?738.

3. J. Elzinga and D.W. Hearn (1972), ?The Minimum Covering Sphere Problem,?Management Science,19, 96?104.

4. J.E. Falk and K.R. Hoffman (1976), ?A Successive Underestimation Method for Concave Minimization Problems,?Mathematics of Operations Research,1, 251?259.

5. C.G. Han, P.M. Pardalos, and Y. Ye (1992), ?On a Solution of Indefinite Quadratic Problems using an Interior Point Algorithm,?Informatica,3, 474?496.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities;Journal of Global Optimization;2006-01

2. Finding robust solutions for product design problems;European Journal of Operational Research;1996-07