A time-sensitive system for black-box combinatorial optimization

被引：0

作者：

Phan, V ^{[1
]}

Sumazin, P ^{[1
]}

Skiena, S ^{[1
]}

机构：

[1] SUNY Stony Brook, Stony Brook, NY 11794 USA

来源：

ALGORITHM ENGINEERING AND EXPERIMENTS | 2002年 / 2409卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：16 / 28

页数：13

共 20 条

[1] AARTS E, 1997, LOCAL SEARCH COMBINA
[2] [Anonymous], SCIENCE
[3] Corne David., 1999, NEW IDEAS OPTIMIZATI
[4] Subdivision direction selection in interval methods for global optimization
Csendes, T
Ratz, D
[J]. SIAM JOURNAL ON NUMERICAL ANALYSIS, 1997, 34 (03) : 922 - 938
[5] Glover F., 1989, ORSA Journal on Computing, V1, P190, DOI [10.1287/ijoc.2.1.4, 10.1287/ijoc.1.3.190]
[6] HOLLAND JH, 1975, ADAPTATION NATURAL A
[7] Ingber L., 1996, Control and Cybernetics, V25, P33
[8] JELASITY M, 2000, LECT NOTES COMPUTER, V1917, P755
[9] OPTIMIZATION BY SIMULATED ANNEALING - AN EXPERIMENTAL EVALUATION .1. GRAPH PARTITIONING
JOHNSON, DS
ARAGON, CR
MCGEOCH, LA
SCHEVON, C
[J]. OPERATIONS RESEARCH, 1989, 37 (06) : 865 - 892
[10] JOHNSON DS, 1991, OPER RES, V39, P878