OPTIMIZATION BY SIMULATED ANNEALING - AN EXPERIMENTAL EVALUATION .1. GRAPH PARTITIONING

被引:730
作者
JOHNSON, DS
ARAGON, CR
MCGEOCH, LA
SCHEVON, C
机构
[1] UNIV CALIF BERKELEY, DIV COMP SCI, BERKELEY, CA 94720 USA
[2] AMHERST COLL, COMP SCI, AMHERST, MA 01002 USA
[3] JOHNS HOPKINS UNIV, COMP SCI, BALTIMORE, MD 21218 USA
关键词
D O I
10.1287/opre.37.6.865
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:865 / 892
页数:28
相关论文
共 43 条
[1]  
AARTS EHL, 1985, P IEEE INT C COMPUTE, P206
[2]  
ANILY S, 1985, SIMULATED ANNEALING
[3]  
[Anonymous], [No title captured]
[4]   THE N-CITY TRAVELING SALESMAN PROBLEM - STATISTICAL-MECHANICS AND THE METROPOLIS ALGORITHM [J].
BONOMI, E ;
LUTTON, JL .
SIAM REVIEW, 1984, 26 (04) :551-568
[5]  
Bui T., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P181
[6]  
BUI T, 1986, COMMUNICATION
[7]  
BUI T, 1983, MITLCSTR287 LAB COMP
[9]  
COLLINS NE, 1988, 88019 U MAR COLL BUS
[10]   A PROCEDURE FOR PLACEMENT OF STANDARD-CELL VLSI CIRCUITS [J].
DUNLOP, AE ;
KERNIGHAN, BW .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1985, 4 (01) :92-98