ON A MULTIDIMENSIONAL SEARCH TECHNIQUE AND ITS APPLICATION TO THE EUCLIDEAN ONE-CENTER PROBLEM

被引：100

作者：

DYER, ME

机构：

来源：

关键词：

D O I：

10.1137/0215052

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：725 / 738

页数：14

共 13 条

[1] Birkhoff G., 1977, SURVEY MODERN ALGEBR, VFourth
[2] Blum M., 1973, Journal of Computer and System Sciences, V7, P448, DOI 10.1016/S0022-0000(73)80033-9
[3] Chandrasekaran R., 1982, Operations Research Letters, V1, P111, DOI 10.1016/0167-6377(82)90009-8
[4] DOBKIN D, 1975, LECT NOTES COMPUTER, V33, P110
[5] SINGLE FACILITY LP-DISTANCE MINIMAX LOCATION
DREZNER, Z
WESOLOWSKY, GO
[J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (03): : 315 - 321
[6] LINEAR TIME ALGORITHMS FOR 2-VARIABLE AND 3-VARIABLE LINEAR-PROGRAMS
DYER, ME
[J]. SIAM JOURNAL ON COMPUTING, 1984, 13 (01) : 31 - 45
[7] THE ELLIPSOID METHOD AND ITS CONSEQUENCES IN COMBINATORIAL OPTIMIZATION
GROTSCHEL, M
LOVASZ, L
SCHRIJVER, A
[J]. COMBINATORICA, 1981, 1 (02) : 169 - 197
[8] EFFICIENT ALGORITHMS FOR THE (WEIGHTED) MINIMUM CIRCLE PROBLEM
HEARN, DW
VIJAY, J
[J]. OPERATIONS RESEARCH, 1982, 30 (04) : 777 - 795
[9] KANNAN R, 1984, 16TH P ANN ACM S THE, P191
[10] LINEAR-TIME ALGORITHMS FOR LINEAR-PROGRAMMING IN R3 AND RELATED PROBLEMS
MEGIDDO, N
[J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (04) : 759 - 776