MINIMUM SPHERE COVERING A CONVEX POLYHEDRON

被引:7
作者
ELZINGA, J
HEARN, D
机构
[1] JOHNS HOPKINS UNIV,BALTIMORE,MD
[2] UNIV FLORIDA,GAINESVILLE,FL
关键词
D O I
10.1002/nav.3800210414
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:715 / 718
页数:4
相关论文
共 7 条
[1]   SOLVING CERTAIN NONCONVEX QUADRATIC MINIMIZATION PROBLEMS BY RANKING EXTREME POINTS [J].
CABOT, AV ;
FRANCIS, RL .
OPERATIONS RESEARCH, 1970, 18 (01) :82-&
[2]   MINIMUM COVERING SPHERE PROBLEM [J].
ELZINGA, DJ ;
HEARN, DW .
MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 19 (01) :96-104
[3]  
ELZINGA J, 1972, TRANSPORTATION SCIEN, V6
[4]   OPTIMAL LOCATION OF A SINGLE SERVICE CENTER OF CERTAIN TYPES [J].
NAIR, KPK ;
CHANDRASEKARAN, R .
NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (04) :503-+
[5]   MODIFIED LINEAR PROGRAM FOR COLUMNAR METHODS IN MATHEMATICAL PROGRAMMING [J].
NEMHAUSER, GL ;
WIDHELM, WB .
OPERATIONS RESEARCH, 1971, 19 (04) :1051-+
[6]  
RITTER K, 1965, Z WAHRSCHEINLICHKEIT, V4, P149
[7]  
Wilde D., 1964, OPTIMUM SEEKING METH