EFFICIENT ALGORITHMS FOR THE (WEIGHTED) MINIMUM CIRCLE PROBLEM

被引：98
作者：
HEARN, DW
VIJAY, J
机构：
来源：
OPERATIONS RESEARCH | 1982年 / 30卷 / 04期
关键词：
D O I：
10.1287/opre.30.4.777
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：777 / 795
页数：19
相关论文
共 23 条
[1]  
BLUMENTHAL LM, 1941, AM MATH SOC B, V47, P771
[2]   INTERACTIVE COMPUTER GRAPHICAL SOLUTIONS OF CONSTRAINED MINIMAX LOCATION-PROBLEMS [J].
BRADY, SD ;
ROSENTHAL, RE .
AIIE TRANSACTIONS, 1980, 12 (03) :241-248
[3]   NOTE ON GEOMETRICAL SOLUTION FOR SOME MINIMAX LOCATION-PROBLEMS [J].
CHAKRABORTY, RK ;
CHAUDHURI, PK .
TRANSPORTATION SCIENCE, 1981, 15 (02) :164-166
[4]  
CHANDRASEKARAN R, 1980, WEIGHTED MINMAX LOCA
[5]   AN ITERATIVE ALGORITHM FOR THE MULTIFACILITY MINIMAX LOCATION PROBLEM WITH EUCLIDEAN DISTANCES [J].
CHARALAMBOUS, C .
NAVAL RESEARCH LOGISTICS, 1981, 28 (02) :325-337
[6]   SUBGRADIENT ALGORITHM FOR CERTAIN MINIMAX AND MINISUM PROBLEMS [J].
CHATELON, JA ;
HEARN, DW ;
LOWE, TJ .
MATHEMATICAL PROGRAMMING, 1978, 15 (02) :130-145
[7]  
CHRYSTAL G, 1885, P EDINBURGH MATH SOC, P00030
[8]  
DEARING PM, 1977, ORSA TIMS M ATLANTA
[9]   SINGLE FACILITY LP-DISTANCE MINIMAX LOCATION [J].
DREZNER, Z ;
WESOLOWSKY, GO .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (03) :315-321
[10]   MINIMUM COVERING SPHERE PROBLEM [J].
ELZINGA, DJ ;
HEARN, DW .
MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 19 (01) :96-104
123