LINEAR-TIME ALGORITHMS FOR LINEAR-PROGRAMMING IN R3 AND RELATED PROBLEMS

被引：531

作者：

MEGIDDO, N

机构：

来源：

关键词：

D O I：

10.1137/0212052

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：759 / 776

页数：18

共 28 条

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2] A HIDDEN-LINE ALGORITHM FOR HYPERSPACE
BURTON, RP
SMITH, DR
[J]. SIAM JOURNAL ON COMPUTING, 1982, 11 (01) : 71 - 80
[3] Chandrasekaran R., 1980, Opsearch, V17, P172
[4] Courant R., 1941, WHAT IS MATH
[5] Dearing P. M., 1974, Transportation Science, V8, P333, DOI 10.1287/trsc.8.4.333
[6] THE COMPLEXITY OF LINEAR-PROGRAMMING
DOBKIN, DP
REISS, SP
[J]. THEORETICAL COMPUTER SCIENCE, 1980, 11 (01) : 1 - 18
[7] SINGLE FACILITY LP-DISTANCE MINIMAX LOCATION
DREZNER, Z
WESOLOWSKY, GO
[J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (03): : 315 - 321
[8] Elzinga DJ., 1972, TRANSPORT SCI, V6, P379, DOI [10.1287/trsc.6.4.379, DOI 10.1287/TRSC.6.4.379]
[9] EXPECTED TIME BOUNDS FOR SELECTION
FLOYD, RW
RIVEST, RL
[J]. COMMUNICATIONS OF THE ACM, 1975, 18 (03) : 165 - 172
[10] SOME ASPECTS OF A MINIMAX LOCATION PROBLEM
FRANCIS, RL
[J]. OPERATIONS RESEARCH, 1967, 15 (06) : 1163 - &