ON THE COMPLEXITY OF THE EXCHANGE ALGORITHM FOR MINIMAX OPTIMIZATION PROBLEMS

被引：6

作者：

DREZNER, Z

机构：

[1] California State Univ, Fullerton,, CA, USA, California State Univ, Fullerton, CA, USA

来源：

关键词：

D O I：

10.1007/BF02604643

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：219 / 222

页数：4

共 6 条

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

DREZNER, Z ;

WESOLOWSKY, GO .

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

[2] FAST ALGORITHMS FOR THE ROUND TRIP LOCATION PROBLEM [J].

DREZNER, Z .

[3] ON MINIMAX OPTIMIZATION PROBLEMS [J].

DREZNER, Z .

[4]

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

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

HEARN, DW ;

VIJAY, J .

[6]

LASDON L, 1970, OPTIMIZATION THEORY