{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:52:57Z","timestamp":1725583977247},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_11","type":"book-chapter","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:43:48Z","timestamp":1369097028000},"page":"84-93","source":"Crossref","is-referenced-by-count":0,"title":["FWLS: A Local Search for Graph Coloring"],"prefix":"10.1007","author":[{"given":"Wei","family":"Wu","sequence":"first","affiliation":[]},{"given":"Chuan","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Kaile","family":"Su","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H.Freeman and Company (1979)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Chaitin, G.J.: Register allocation and spilling via graph coloring (with retrospective). Best of PLDI, 66\u201374 (1982)","DOI":"10.1145\/800230.806984"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"de Werra, D., Eisenbeis, C., Lelait, S., Marmol, B.: On a Graph-theoretical Model for Cyclic Register Allocation. Discrete Applied Mathematics, 191\u2013203 (1999)","DOI":"10.1016\/S0166-218X(99)00105-5"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Burke, E.K., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A graph-based hyper-heuristic for educational timetabling problems. European Journal of Operational Research, 177\u2013192 (2007)","DOI":"10.1016\/j.ejor.2005.08.012"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Zufferey, N., Amstutz, P., Giaccari, P.: Graph colouring approaches for a satellite range scheduling problem. J. Scheduling, 263\u2013277 (2008)","DOI":"10.1007\/s10951-008-0066-8"},{"key":"11_CR6","first-page":"544","volume":"5","author":"C. Class","year":"2002","unstructured":"Class, C.: Bag rationalisation for a food manufacture. Journal of the Operational Research Society\u00a05, 544\u2013551 (2002)","journal-title":"Journal of the Operational Research Society"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Hertz, A., de Werra, D.: Using Tabu Search Techniques for Graph Coloring. Computing, 345\u2013351 (1987)","DOI":"10.1007\/BF02239976"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Blchliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive tabu scheme. Computers & OR, 960\u2013975 (2008)","DOI":"10.1016\/j.cor.2006.05.014"},{"key":"11_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., Polytechnique, \u00c9., de Lausanne, F.: New Methods to Color the Vertices of a Graph. Communications of ACM\u00a022, 251\u2013256 (1979)","journal-title":"Communications of ACM"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-14186-7_31","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"L. Kroc","year":"2010","unstructured":"Kroc, L., Sabharwal, A., Selman, B.: An Empirical Study of Optimal Noise and Runtime Distributions in Local Search. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol.\u00a06175, pp. 346\u2013351. Springer, Heidelberg (2010)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-72397-4_25","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"M.A. Trick","year":"2007","unstructured":"Trick, M.A., Yildiz, H.: A Large Neighborhood Search Heuristic for Graph Coloring. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol.\u00a04510, pp. 346\u2013360. Springer, Heidelberg (2007)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Galinier, P., Hertz, A., Zufferey, N.: An adaptive memory algorithm for the k-coloring problem. Discrete Applied Mathematics, 267\u2013279 (2008)","DOI":"10.1016\/j.dam.2006.07.017"},{"key":"11_CR13","unstructured":"Hoos, H.H.: An Adaptive Noise Mechanism for WalkSAT. In: AAAI\/IAAI, pp. 655\u2013660 (2002)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-14186-7_3","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"A. Balint","year":"2010","unstructured":"Balint, A., Fr\u00f6hlich, A.: Improving Stochastic Local Search for SAT with a New Probability Distribution. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol.\u00a06175, pp. 10\u201315. Springer, Heidelberg (2010)"},{"key":"11_CR15","unstructured":"McAllester, D.A., Selman, B., Kautz, H.A.: Evidence for Invariants in Local Search. In: AAAI\/IAAI, pp. 321\u2013326 (1997)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-72788-0_15","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"C.M. Li","year":"2007","unstructured":"Li, C.M., Wei, W., Zhang, H.: Combining Adaptive Noise and Look-Ahead in Local Search for SAT. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 121\u2013133. Springer, Heidelberg (2007)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Bui, T.N., Nguyen, T.H., Patel, C.M., Phan, K.-A.T.: An ant-based algorithm for coloring graphs. Discrete Applied Mathematics, 190\u2013200 (2008)","DOI":"10.1016\/j.dam.2006.07.012"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"L\u00fc, Z., Hao, J.-K.: A memetic algorithm for graph coloring. European Journal of Operational Research, 241\u2013250 (2010)","DOI":"10.1016\/j.ejor.2009.07.016"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Malaguti, E., Monaci, M., Toth, P.: A Metaheuristic Approach for the Vertex Coloring Problem. INFORMS Journal on Computing, 302\u2013316 (2008)","DOI":"10.1287\/ijoc.1070.0245"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Porumbel, D.C., Hao, J.-K., Kuntz, P.: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring. Computers & OR, 1822\u20131832 (2010)","DOI":"10.1016\/j.cor.2010.01.015"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/3-540-46033-0_14","volume-title":"Artificial Evolution","author":"J.-P. Hamiez","year":"2002","unstructured":"Hamiez, J.-P., Hao, J.-K.: Scatter Search for Graph Coloring. In: Collet, P., Fonlupt, C., Hao, J.-K., Lutton, E., Schoenauer, M. (eds.) EA 2001. LNCS, vol.\u00a02310, pp. 168\u2013179. Springer, Heidelberg (2002)"},{"key":"11_CR22","unstructured":"Fridcn, C., Hertz, A., de Werra, D.: Lausanne: STABULUS: A Technique for Finding Stable Sets in Large Graphs with Tabu Search Computing. 42, 35\u201344 (1989)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Yesil, C., Yilmaz, B., Korkmaz, E.E.: Hybrid local search algorithms on Graph Coloring Problem. In: HIS, pp. 468\u2013473 (2011)","DOI":"10.1109\/HIS.2011.6122150"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Galinier, P., Hao, J.-K.: Hybrid Evolutionary Algorithms for Graph Coloring. J. Comb. Optim., 379\u2013397 (1999)","DOI":"10.1023\/A:1009823419804"},{"key":"11_CR25","unstructured":"Gent, I.P., Walsh, T.: Towards an Understanding of Hill-Climbing Procedures for SAT. In: AAAI, pp. 28\u201333 (1993)"},{"key":"11_CR26","unstructured":"Garey, M.R., Johnson, D.S.: In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability (2009)"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Bounkong, S., van Mourik, J., Saad, D.: Coloring random graphs and maximizing local diversity. Physical Review E (2006)","DOI":"10.1103\/PhysRevE.74.057101"},{"key":"11_CR28","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1016\/j.cor.2005.07.028","volume":"33","author":"P. Galinier","year":"2006","unstructured":"Galinier, P., Hertz, A.: A survey of local search methods for graph coloring. Computers & Operations Research\u00a033, 2547\u20132562 (2006)","journal-title":"Computers & Operations Research"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F.T. Leighton","year":"1979","unstructured":"Leighton, F.T.: A Graph Coloring Algorithm for Large Scheduling Problems. Journal of Research of the National Bureau of Standards\u00a084, 489\u2013506 (1979)","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Porumbel, D.C., Hao, J.-K., Kuntz, P.: A search space \u201ccartography\u201d for guiding graph coloring heuristics. Computers & OR, 769\u2013778 (2010)","DOI":"10.1016\/j.cor.2009.06.024"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Hertz, A., Plumettaz, M., Zufferey, N.: Variable space search for graph coloring. Discrete Applied Mathematics, 2551\u20132560 (2008)","DOI":"10.1016\/j.dam.2008.03.022"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T03:11:00Z","timestamp":1557717060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}