ON THE COMPLEXITY OF THE ELZINGA-HEARN ALGORITHM FOR THE 1-CENTER PROBLEM

被引：12

作者：

DREZNER, Z

SHELAH, S

机构：

[1] HEBREW UNIV JERUSALEM,INST MATH & COMP SCI,JERUSALEM,ISRAEL

[2] UNIV MICHIGAN,DEPT ELECT ENGN & COMP SCI,ANN ARBOR,MI 48109

[3] UNIV NANCY 1,DEPT MATH,F-54506 VANDOEUVRE NANCY,FRANCE

来源：

关键词：

D O I：

10.1287/moor.12.2.255

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：255 / 261

页数：7

共 6 条

[1]

DOMSCHKE W, 1985, LECTURE NOTES EC MAT, V238

[2] SINGLE FACILITY LP-DISTANCE MINIMAX LOCATION [J].

DREZNER, Z ;

WESOLOWSKY, GO .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (03) :315-321

[3]

Elzinga DJ., 1972, TRANSPORT SCI, V6, P379, DOI [10.1287/trsc.6.4.379, DOI 10.1287/TRSC.6.4.379]

[4] EFFICIENT ALGORITHMS FOR THE (WEIGHTED) MINIMUM CIRCLE PROBLEM [J].

HEARN, DW ;

VIJAY, J .

MEGIDDO, N .

[6]

MEGIDDO N, COMMUNICATION