OPEN QUESTIONS IN COMPLEXITY THEORY FOR NUMERICAL OPTIMIZATION

被引：23

作者：

PARDALOS, PM ^{[1
]}

VAVASIS, SA ^{[1
]}

机构：

[1] CORNELL UNIV,DEPT COMP SCI,ITHACA,NY 14853

来源：

关键词：

D O I：

10.1007/BF01581088

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

[No abstract available]

引用

页码：337 / 339

页数：3

共 20 条

[1]

BELLARE M, 1992, UNPUB COMPLEXITY APP

DYER, ME .

[3]

Guisewite G. M., 1990, Annals of Operations Research, V25, P75, DOI 10.1007/BF02283688

[4]

GUISEWITE GM, 1992, IN PRESS NETWORKS

[5]

HAN CG, 1991, UNPUB INTERIOR POINT

[6] HOW EASY IS LOCAL SEARCH [J].

JOHNSON, DS ;

PAPADIMITRIOU, CH ;

YANNAKAKIS, M .

[7] BIMATRIX EQUILIBRIUM POINTS AND MATHEMATICAL-PROGRAMMING [J].

LEMKE, CE .

[8] LINEAR-PROGRAMMING IN LINEAR TIME WHEN THE DIMENSION IS FIXED [J].

MEGIDDO, N .

[9]

MEGIDDO N, 1988, IBM RJ6439 ALM RES C

[10]

MORE JJ, 1991, MATH PROGRAM, V49, P397