{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:23:47Z","timestamp":1774121027796,"version":"3.50.1"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031445040","type":"print"},{"value":"9783031445057","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-44505-7_33","type":"book-chapter","created":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T18:03:41Z","timestamp":1698170621000},"page":"491-505","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Generating a\u00a0Graph Colouring Heuristic with\u00a0Deep Q-Learning and\u00a0Graph Neural Networks"],"prefix":"10.1007","author":[{"given":"George","family":"Watkins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Montana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juergen","family":"Branke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,25]]},"reference":[{"issue":"2","key":"33_CR1","first-page":"1","volume":"3","author":"S Ahmed","year":"2012","unstructured":"Ahmed, S.: Applications of graph coloring in modern computer science. Int. J. Comput. Inf. Technol. 3(2), 1\u20137 (2012)","journal-title":"Int. J. Comput. Inf. Technol."},{"issue":"3","key":"33_CR2","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"CR Aragon","year":"1991","unstructured":"Aragon, C.R., Johnson, D., McGeoch, L., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning. Oper. Res. 39(3), 378\u2013406 (1991)","journal-title":"Oper. Res."},{"issue":"5439","key":"33_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Barrett, T., Clements, W., Foerster, J., Lvovsky, A.: Exploratory combinatorial optimization with reinforcement learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 3243\u20133250 (2020)","DOI":"10.1609\/aaai.v34i04.5723"},{"key":"33_CR5","unstructured":"Battaglia, P.W., et al.: Relational inductive biases, deep learning, and graph networks. arXiv:1806.01261 (2018)"},{"issue":"2","key":"33_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019Horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-540-39658-1_52","volume-title":"Algorithms - ESA 2003","author":"U Brandes","year":"2003","unstructured":"Brandes, U., Gaertler, M., Wagner, D.: Experiments on graph clustering algorithms. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 568\u2013579. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_52"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/TEVC.2015.2429314","volume":"20","author":"J Branke","year":"2015","unstructured":"Branke, J., Nguyen, S., Pickardt, C.W., Zhang, M.: Automated design of production scheduling heuristics: a review. IEEE Trans. Evol. Comput. 20(1), 110\u2013124 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"33_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251\u2013256 (1979)","journal-title":"Commun. ACM"},{"key":"33_CR10","unstructured":"Corso, G., Cavalleri, L., Beaini, D., Li\u00f2, P., Veli\u010dkovi\u0107, P.: Principal neighbourhood aggregation for graph nets. In: Advances in Neural Information Processing Systems, vol. 33, pp. 13260\u201313271 (2020)"},{"issue":"1","key":"33_CR11","first-page":"290","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs I. Publicationes Math. 6(1), 290\u2013297 (1959)","journal-title":"Publicationes Math."},{"issue":"3","key":"33_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2478\/v10209-011-0012-y","volume":"37","author":"P Formanowicz","year":"2012","unstructured":"Formanowicz, P., Tana\u015b, K.: A survey of graph coloring - its types, methods and applications. Found. Comput. Decis. Sci. 37(3), 223\u2013238 (2012)","journal-title":"Found. Comput. Decis. Sci."},{"key":"33_CR13","unstructured":"Fricke, G., et al.: Combinatorial problems on chessboards: a brief survey. In: Quadrennial International Conference on the Theory and Applications of Graphs, vol. 1, pp. 507\u2013528 (1995)"},{"issue":"4","key":"33_CR14","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. J. Comb. Optim. 3(4), 379\u2013397 (1999)","journal-title":"J. Comb. Optim."},{"key":"33_CR15","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability, vol. 174. Freeman, San Francisco (1979)"},{"key":"33_CR16","unstructured":"Gianinazzi, L., Fries, M., Dryden, N., Ben-Nun, T., Besta, M., Hoefler, T.: Learning combinatorial node labeling algorithms. arXiv preprint arXiv:2106.03594 (2021)"},{"issue":"4","key":"33_CR17","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A Hertz","year":"1987","unstructured":"Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39(4), 345\u2013351 (1987)","journal-title":"Computing"},{"key":"33_CR18","unstructured":"Huang, J., Patwary, M., Diamos, G.: Coloring big graphs with alphagozero. arXiv preprint arXiv:1902.10162 (2019)"},{"key":"33_CR19","unstructured":"Ireland, D., Montana, G.: Lense: Learning to navigate subgraph embeddings for large-scale combinatorial optimisation. In: International Conference on Machine Learning (2022)"},{"issue":"1\u20133","key":"33_CR20","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0012-365X(00)00439-8","volume":"236","author":"R Janczewski","year":"2001","unstructured":"Janczewski, R., Kubale, M., Manuszewski, K., Piwakowski, K.: The smallest hard-to-color graph for algorithm DSATUR. Discret. Math. 236(1\u20133), 151\u2013165 (2001)","journal-title":"Discret. Math."},{"key":"33_CR21","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"key":"33_CR22","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56039-6","volume-title":"Combinatorial Optimization","author":"B Korte","year":"2018","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization. AC, vol. 21. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-56039-6"},{"issue":"6","key":"33_CR23","doi-asserted-by":"publisher","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"FT Leighton","year":"1979","unstructured":"Leighton, F.T.: A graph coloring algorithm for large scheduling problems. J. Res. Natl. Bur. Stand. 84(6), 489\u2013506 (1979)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Lemos, H., Prates, M., Avelar, P., Lamb, L.: Graph colouring meets deep learning: effective graph neural network models for combinatorial problems. In: International Conference on Tools with Artificial Intelligence, pp. 879\u2013885. IEEE (2019)","DOI":"10.1109\/ICTAI.2019.00125"},{"key":"33_CR25","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81054-2","volume-title":"Guide to Graph Colouring","author":"RMR Lewis","year":"2021","unstructured":"Lewis, R.M.R.: Guide to Graph Colouring. TCS, Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81054-2"},{"issue":"4","key":"33_CR26","doi-asserted-by":"publisher","first-page":"57","DOI":"10.22456\/2175-2745.80721","volume":"25","author":"AM de Lima","year":"2018","unstructured":"de Lima, A.M., Carmo, R.: Exact algorithms for the graph coloring problem. Revista de Inform\u00e1tica Te\u00f3rica e Aplicada 25(4), 57\u201373 (2018)","journal-title":"Revista de Inform\u00e1tica Te\u00f3rica e Aplicada"},{"issue":"1","key":"33_CR27","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","volume":"203","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Hao, J.K.: A memetic algorithm for graph coloring. Eur. J. Oper. Res. 203(1), 241\u2013250 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"33_CR28","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM (JACM) 41(5), 960\u2013981 (1994)","journal-title":"J. ACM (JACM)"},{"key":"33_CR29","doi-asserted-by":"publisher","first-page":"105400","DOI":"10.1016\/j.cor.2021.105400","volume":"134","author":"N Mazyavkina","year":"2021","unstructured":"Mazyavkina, N., Sviridov, S., Ivanov, S., Burnaev, E.: Reinforcement learning for combinatorial optimization: a survey. Comput. Oper. Res. 134, 105400 (2021)","journal-title":"Comput. Oper. Res."},{"key":"33_CR30","unstructured":"Mnih, V., et al.: Playing atari with deep reinforcement learning. arXiv:1312.5602 (2013)"},{"issue":"1","key":"33_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-017-9354-9","volume":"24","author":"L Moalic","year":"2018","unstructured":"Moalic, L., Gondran, A.: Variations on memetic algorithms for graph coloring problems. J. Heuristics 24(1), 1\u201324 (2018)","journal-title":"J. Heuristics"},{"issue":"3","key":"33_CR32","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1287\/ijoc.3.3.226","volume":"3","author":"TJ Sager","year":"1991","unstructured":"Sager, T.J., Lin, S.J.: A pruning procedure for exact graph coloring. ORSA J. Comput. 3(3), 226\u2013230 (1991)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"33_CR33","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2008","unstructured":"Scarselli, F., Gori, M., Tsoi, A.C., Hagenbuchner, M., Monfardini, G.: The graph neural network model. IEEE Trans. Neural Netw. 20(1), 61\u201380 (2008)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"7676","key":"33_CR34","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1038\/nature24270","volume":"550","author":"D Silver","year":"2017","unstructured":"Silver, D., et al.: Mastering the game of go without human knowledge. Nature 550(7676), 354\u2013359 (2017)","journal-title":"Nature"},{"issue":"1","key":"33_CR35","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.11.1.15","volume":"11","author":"KA Smith","year":"1999","unstructured":"Smith, K.A.: Neural networks for combinatorial optimization: a review of more than a decade of research. INFORMS J. Comput. 11(1), 15\u201334 (1999)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"33_CR36","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0166-218X(85)90043-5","volume":"12","author":"JP Spinrad","year":"1985","unstructured":"Spinrad, J.P., Vijayan, G.: Worst case analysis of a graph coloring algorithm. Discret. Appl. Math. 12(1), 89\u201392 (1985)","journal-title":"Discret. Appl. Math."},{"key":"33_CR37","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"issue":"3","key":"33_CR38","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00992698","volume":"8","author":"CJ Watkins","year":"1992","unstructured":"Watkins, C.J., Dayan, P.: Q-learning. Mach. Learn. 8(3), 279\u2013292 (1992)","journal-title":"Mach. Learn."},{"issue":"6684","key":"33_CR39","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"3","key":"33_CR40","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00992696","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach. Learn. 8(3), 229\u2013256 (1992)","journal-title":"Mach. Learn."},{"key":"33_CR41","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.eswa.2016.07.047","volume":"64","author":"Y Zhou","year":"2016","unstructured":"Zhou, Y., Hao, J.K., Duval, B.: Reinforcement learning based local search for grouping problems: a case study on graph coloring. Expert Syst. Appl. 64, 412\u2013422 (2016)","journal-title":"Expert Syst. Appl."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44505-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T18:07:05Z","timestamp":1698170825000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44505-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031445040","9783031445057"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44505-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion17.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}