{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:56Z","timestamp":1750306076666,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1145\/3071178.3071291","type":"proceedings-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T17:59:28Z","timestamp":1498845568000},"page":"314-320","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic rope team"],"prefix":"10.1145","author":[{"given":"Laurent","family":"Moalic","sequence":"first","affiliation":[{"name":"Univ. Bourgogne Franche-Comt\u00e9, Belfort, France"}]},{"given":"Alexandre","family":"Gondran","sequence":"additional","affiliation":[{"name":"French Civil Aviation University, Toulouse, France"}]}],"member":"320","published-online":{"date-parts":[[2017,7]]},"reference":[{"volume-title":"Evolutionary Computation in Combinatorial Optimization","series-title":"Lecture Notes in Computer Science","key":"e_1_3_2_1_1_1","unstructured":"2015. In Evolutionary Computation in Combinatorial Optimization . Lecture Notes in Computer Science , Vol. 9026 . 2015. In Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, Vol. 9026."},{"key":"e_1_3_2_1_2_1","first-page":"261","article-title":"Models and solution techniques for frequency assignment problems","volume":"1","author":"Aardal I.","year":"2003","unstructured":"Karen I. Aardal , Stan P.M. Hoesel , Arie M.C.A. Koster , Carlo Mannino , and Antonio Sassano . 2003 . Models and solution techniques for frequency assignment problems . Quarterly Journal of the Belgian, French and Italian Operations Research Societies 1 , 4 (2003), 261 -- 317 . KarenI. Aardal, StanP.M. Hoesel, ArieM.C.A. Koster, Carlo Mannino, and Antonio Sassano. 2003. Models and solution techniques for frequency assignment problems. Quarterly Journal of the Belgian, French and Italian Operations Research Societies 1, 4 (2003), 261--317.","journal-title":"Quarterly Journal of the Belgian, French and Italian Operations Research Societies"},{"key":"e_1_3_2_1_3_1","volume-title":"A variable neighborhood search for graph coloring. European Journal of Operational Research","author":"Avanthay C.","year":"2003","unstructured":"C. Avanthay , Alain Hertz , and Nicolas Zufferey . 2003. A variable neighborhood search for graph coloring. European Journal of Operational Research ( 2003 ). C. Avanthay, Alain Hertz, and Nicolas Zufferey. 2003. A variable neighborhood search for graph coloring. European Journal of Operational Research (2003)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000032574.01332.98"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013665718444"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.03.006"},{"volume-title":"Handbook of Genetic Algorithms","author":"Davis L.","key":"e_1_3_2_1_8_1","unstructured":"L. Davis . 1991. Order-based Genetic Algorithms and the Graph Coloring Problem . In Handbook of Genetic Algorithms . Van Nostrand Reinhold ; New York, 72--90. L. Davis. 1991. Order-based Genetic Algorithms and the Graph Coloring Problem. In Handbook of Genetic Algorithms. Van Nostrand Reinhold; New York, 72--90."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125407"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009823419804"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Fred Glover Mark Parker and Jennifer Ryan. 1996. Coloring by Tabu Branch and Bound. See {16} 285--307.  Fred Glover Mark Parker and Jennifer Ryan. 1996. Coloring by Tabu Branch and Bound. See {16} 285--307.","DOI":"10.1090\/dimacs\/026\/14"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1100.0436"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02239976"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.03.022"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2768947.2768951"},{"key":"e_1_3_2_1_16_1","volume-title":"Johnson and Michael Trick (Eds.)","author":"David","year":"1996","unstructured":"David S. Johnson and Michael Trick (Eds.) . 1996 . Cliques, Coloring , and Satisfiability: Second DIMACS Implementation Challenge, 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26 . American Mathematical Society , Providence, RI, USA. David S. Johnson and Michael Trick (Eds.). 1996. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26. American Mathematical Society, Providence, RI, USA."},{"volume-title":"Complexity of Computer Computations","author":"Karp R.M.","key":"e_1_3_2_1_17_1","unstructured":"R.M. Karp . 1972. Reducibility among combinatorial problems . In Complexity of Computer Computations , R. E. Miller and J. W. Thatcher (Eds.). Plenum Press , New York, USA , 85--103. R.M. Karp. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher (Eds.). Plenum Press, New York, USA, 85--103."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.084.024"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.09.004"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.07.016"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.8.4.344"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2009.27"},{"key":"e_1_3_2_1_23_1","volume-title":"Graph coloring and linear programming. (July","author":"Schindl David","year":"2003","unstructured":"David Schindl . 2003. Graph coloring and linear programming. (July 2003 ). http:\/\/roso.epfl.ch\/ibm\/jord03.html Presentation at First Joint Operations Research Days, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL) , available on line (last visited June 2005). David Schindl. 2003. Graph coloring and linear programming. (July 2003). http:\/\/roso.epfl.ch\/ibm\/jord03.html Presentation at First Joint Operations Research Days, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), available on line (last visited June 2005)."},{"volume-title":"Agent and Multi-Agent Systems: Technologies and Applications","author":"Titiloye Olawale","key":"e_1_3_2_1_24_1","unstructured":"Olawale Titiloye and Alan Crispin . 2011. Graph Coloring with a Distributed Hybrid Quantum Annealing Algorithm . In Agent and Multi-Agent Systems: Technologies and Applications . Springer Berlin \/ Heidelberg . Olawale Titiloye and Alan Crispin. 2011. Graph Coloring with a Distributed Hybrid Quantum Annealing Algorithm. In Agent and Multi-Agent Systems: Technologies and Applications. Springer Berlin \/ Heidelberg."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2010.12.001"},{"key":"e_1_3_2_1_26_1","volume-title":"Parameter Tuning Patterns for Random Graph Coloring with Quantum Annealing. PLoS ONE 7, 11 (11","author":"Titiloye Olawale","year":"2012","unstructured":"Olawale Titiloye and Alan Crispin . 2012. Parameter Tuning Patterns for Random Graph Coloring with Quantum Annealing. PLoS ONE 7, 11 (11 2012 ), e50060. Olawale Titiloye and Alan Crispin. 2012. Parameter Tuning Patterns for Random Graph Coloring with Quantum Annealing. PLoS ONE 7, 11 (11 2012), e50060."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/12.4.317"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.04.002"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-008-0066-8"},{"key":"e_1_3_2_1_30_1","volume-title":"On some properties of linear complexes. Mat. Sb. (N.S.) 24, 66(2)","author":"Zykov A. A.","year":"1949","unstructured":"A. A. Zykov . 1949. On some properties of linear complexes. Mat. Sb. (N.S.) 24, 66(2) ( 1949 ), 163--188. A. A. Zykov. 1949. On some properties of linear complexes. Mat. Sb. (N.S.) 24, 66(2) (1949), 163--188."}],"event":{"name":"GECCO '17: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Berlin Germany","acronym":"GECCO '17"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3071291","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3071178.3071291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:05Z","timestamp":1750217405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3071291"}},"subtitle":["a parallel algorithm for graph coloring"],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":30,"alternative-id":["10.1145\/3071178.3071291","10.1145\/3071178"],"URL":"https:\/\/doi.org\/10.1145\/3071178.3071291","relation":{},"subject":[],"published":{"date-parts":[[2017,7]]},"assertion":[{"value":"2017-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}