SOME EXPERIMENTS WITH SIMULATED ANNEALING FOR COLORING GRAPHS

[1] THE N-CITY TRAVELING SALESMAN PROBLEM - STATISTICAL-MECHANICS AND THE METROPOLIS ALGORITHM [J]. SIAM REVIEW, 1984, 26 (04) : 551 - 568

[2] NEW METHODS TO COLOR THE VERTICES OF A GRAPH [J]. COMMUNICATIONS OF THE ACM, 1979, 22 (04) : 251 - 256

[3] AN INTRODUCTION TO TIMETABLING [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 19 (02) : 151 - 162

[4] Garey Michael R., 1979, COMPUTERS INTRACTABI

[5] HAJEK B, 1985, COOLING SCHEDULES OP

[6] COMPLETE-LINK CLUSTER-ANALYSIS BY GRAPH COLORING [J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1978, 73 (362) : 397 - 403

[7] Johnson D., COMMUNICATION

[8] JOHRI A, 1982, PROBABILISTIC BOUNDS

[9] OPTIMIZATION BY SIMULATED ANNEALING [J]. SCIENCE, 1983, 220 (4598) : 671 - 680

[10] KUMAR KR, 1986, EUR J OPER RES, V24, P387, DOI 10.1016/0377-2217(86)90032-9

[1] THE N-CITY TRAVELING SALESMAN PROBLEM - STATISTICAL-MECHANICS AND THE METROPOLIS ALGORITHM [J]. SIAM REVIEW, 1984, 26 (04) : 551 - 568

[2] NEW METHODS TO COLOR THE VERTICES OF A GRAPH [J]. COMMUNICATIONS OF THE ACM, 1979, 22 (04) : 251 - 256

[3] AN INTRODUCTION TO TIMETABLING [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 19 (02) : 151 - 162

[4] Garey Michael R., 1979, COMPUTERS INTRACTABI

[5] HAJEK B, 1985, COOLING SCHEDULES OP

[6] COMPLETE-LINK CLUSTER-ANALYSIS BY GRAPH COLORING [J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1978, 73 (362) : 397 - 403

[7] Johnson D., COMMUNICATION

[8] JOHRI A, 1982, PROBABILISTIC BOUNDS

[9] OPTIMIZATION BY SIMULATED ANNEALING [J]. SCIENCE, 1983, 220 (4598) : 671 - 680

[10] KUMAR KR, 1986, EUR J OPER RES, V24, P387, DOI 10.1016/0377-2217(86)90032-9