论文信息 - Some experiments with simulated annealing for coloring graphs - 字舞流文

Some experiments with simulated annealing for coloring graphs

D. Werra | A. Hertz | M. Chams

[1] Bruce E. Hajek,et al. Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[2] Andrew Kusiak,et al. Grouping of parts and components in flexible manufacturing systems , 1986 .

[3] D. de Werra,et al. An introduction to timetabling , 1985 .

[4] E. Bonomi,et al. The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm , 1984 .

[5] F. Rendl,et al. A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .

[6] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[7] Frank Thomson Leighton,et al. A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.

[8] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.

[9] P. Hansen,et al. Complete-Link Cluster Analysis by Graph Coloring , 1978 .

[10] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[11] Kathryn E. Stecke,et al. Design, planning, scheduling, and control problems of flexible manufacturing systems , 1985 .