Quantum annealing of the graph coloring problem

Discrete Optimization

Volumn 8, Issue 2, 2011, Pages 376-384

  Titiloye, Olawale ^a   Crispin, Alan ^a  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

Combinatorial optimization; Graph coloring problem; Quantum annealing; Simulated annealing

Indexed keywords

CHROMATIC NUMBER; GRAPH COLORING PROBLEM; MONTE CARLO; PATH-INTEGRAL; QUANTUM ANNEALING; QUANTUM FLUCTUATION; THERMAL SIMULATED ANNEALING;

ALGORITHMS; ANNEALING; BIOELECTRIC PHENOMENA; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; QUANTUM ELECTRONICS;

SIMULATED ANNEALING;

EID: 79955618005     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2010.12.001     Document Type: Article

References (29)

1. F.C. Chow, and J.L. Hennessy The priority-based coloring approach to register allocation ACM Transactions on Programming Languages and Systems 12 4 1990 501 536
2. E.K. Burke, D.G. Elliman, and R.F. Weare A university timetabling system based on graph colouring and constraint manipulation Journal of Research on Computing in Education 27 1994 1 18
3. F.T Leighton A graph colouring algorithm for large scheduling problems Journal of Research of the National Bureau of Standards 84 1979 489 506
4. M.R. Garey, and D.S. Johnson The complexity of near-optimal graph coloring Journal of the ACM (JACM) 23 1 1976 43 49
5. T.J. Sager, and S. Lin A pruning procedure for exact graph coloring ORSA Journal on Computing 3 3 1991 226 230
6. D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning Operations Research 39 3 1991 378 406
7. P. Galinier, and A. Hertz A survey of local search methods for graph coloring Computers and Operations Research 33 6 2006 2547 2562 (Pubitemid 43098900)
8. D. Fotakis, S.D. Likothanassis, and S. Stefanakos An evolutionary annealing approach to graph coloring E.J.W. Boers, J. Gottlieb, P.L. Lanzi, R.E. Smith, S. Cagnoni, E. Hart, G.R. Raidl, H. Tijink, Applications of Evolutionary Computing, EvoWorkshops Lecture Notes in Computer Science vol. 2037 2001 Springer 120 129 (Pubitemid 33261161)
9. A. Hertz, and D. de Werra Using Tabu search techniques for graph coloring Computing 39 1987 345 351 (Pubitemid 18562739)
10. P. Galinier, and J.-K. Hao Hybrid evolutionary algorithms for graph coloring Journal of Combinatorial Optimization 3 4 1999 379 397 (Pubitemid 129575323)
11. E. Malaguti, M. Monaaci, and P. Toth A metaheuristic approach for the vertex coloring problem INFORMS Journal on Computing 20 2 2008 302 316
12. Z. L, and J.-K. Hao A memetic algorithm for graph coloring European Journal of Operational Research 203 1 2010 241 250
13. D.C. Porumbel, J.-K. Hao, and P. Kuntz An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring Computers and Operations Research 37 1 2010 1822 1832
14. A. Das, and B.K. Chakrabarti Quantum Annealing and quantum analog computation Reviews of Modern Physics 80 2008 1061
15. S. Kirkpatrick, C. Gelatt, and M. Vecchi Optimization by simulated annealing Science 220 1983 671 680
16. R. Martok, G.E. Santoro, and E. Tosatti Quantum annealing of the traveling salesman problem Physical Review E 70 2004 057701
17. G.E Santoro, R. Martok, E. Tosatti, and R. Car Theory of quantum annealing of an Ising spin glass Science 295 2002 2427
18. S. Morita, and H. Nishimori Mathematical foundations of quantum annealing Mathematical Physics 49 2008 12521
19. M. Chams, A. Hertz, and D. de Werra Some experiments with simulated annealing for coloring graphs European Journal of Operational Research 32 2 1987 260 266 Elsevier (Pubitemid 18516642)
20. D.A. Battaglia, G.E. Santoro, and E. Tosatti Optimization by quantum annealing: lessons from hard satisfiability problems Physical Review E 71 2005 66707
21. L. Stella, G.E. Santoro, and E. Tosatti Optimization by quantum annealing: lessons from simple cases Physical Review B 72 2005 014303
22. R. Martok, G.E. Santoro, and E. Tosatti Quantum annealing by the path integral Monte Carlo method: the two dimensional random Ising model Physical Review B 66 2002 094203
23. M. Suzuki Relationship between d-dimensional quantal spin systems and (d + 1 ) -dimensional Ising systems equivalence critical exponents and systematic approximants of the partition function and spin correlations Progress of Theoretical Physics 56 5 1976 1454 1469
24. H.F. Trotter On the product of semi-groups of operators Proceedings of the American Mathematical Society 10 4 1959 545 551
25. D.S. Johnson, and M. Trick Cliques, colorings and satisfiability second DIMACS implementation challenge D.S. Johnson, M.A. Trick, Proceedings of the 2nd DIMACS Implementation Challenge DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 1996 American Mathematical Society
26. C. Morgenstern Distributed coloration neighborhood search D.S. Johnson, M.A. Trick, Proceedings of the 2nd DIMACS Implementation Challenge DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 1996 American Mathematical Society 335 358
27. N. Funabiki, and T. Higashino A minimal-state processing search algorithm for graph coloring problems IEICE Transaction Fundamentals E83-A 2000 1420 1430
28. P. Galinier, A. Hertz, and N. Zufferey An adaptive memory algorithm for the K-coloring problem Discrete Applied Mathematics 156 2 2008 267 279 (Pubitemid 350251597)
29. I. Blochliger, and N. Zufferey A graph coloring heuristic using partial solutions and a reactive Tabu scheme Computers and Operations Research 35 3 2008 960 975 (Pubitemid 47368857)