{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T06:19:39Z","timestamp":1786083579353,"version":"3.56.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_30","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T05:42:05Z","timestamp":1405921325000},"page":"347-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Tabu Search Heuristic for the Equitable Coloring Problem"],"prefix":"10.1007","author":[{"given":"Isabel","family":"M\u00e9ndez D\u00edaz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Graciela","family":"Nasini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Sever\u00edn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"920","DOI":"10.2307\/2319405","volume":"80","author":"W Meyer","year":"1973","unstructured":"Meyer, W.: Equitable coloring. Amer. Math. Mon. 80, 920\u2013922 (1973)","journal-title":"Amer. Math. Mon."},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1137\/1015072","volume":"15","author":"A Tucker","year":"1973","unstructured":"Tucker, A.: Perfect graphs and an application to optimizing municipal services. SIAM Rev. 15, 585\u2013590 (1973)","journal-title":"SIAM Rev."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1016\/j.jpdc.2006.06.004","volume":"66","author":"SK Das","year":"2006","unstructured":"Das, S.K., Finocchi, I., Petreschi, R.: Conflict-free star-access in parallel memory systems. J. Parallel Distrib. Comput. 66, 1431\u20131441 (2006)","journal-title":"J. Parallel Distrib. Comput."},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/3-540-44666-4_31","volume-title":"Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques","author":"SV Pemmaraju","year":"2001","unstructured":"Pemmaraju, S.V.: Equitable coloring extends Chernoff-Hoeffding bounds. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX-RANDOM 2001. LNCS, vol. 2129, p. 285. Springer, Heidelberg (2001)"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1090\/conm\/352\/03","volume-title":"Graph Colorings","author":"H Furmanczyk","year":"2004","unstructured":"Furmanczyk, H., Kubale, M.: Equitable coloring of graphs. In: Kubale, M. (ed.) Graph Colorings, pp. 35\u201353. American Mathematical Society, Providence (2004)"},{"key":"30_CR6","first-page":"601","volume":"2","author":"A Hajnal","year":"1970","unstructured":"Hajnal, A., Szemer\u00e9di, E.: Proof of a conjecture of P. Erd\u00f6s. Combin. theory and its app. 2, 601\u2013623 (1970)","journal-title":"Erd\u00f6s. Combin. theory and its app."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00493-010-2483-5","volume":"30","author":"H Kierstead","year":"2010","unstructured":"Kierstead, H., Kostochka, A., Mydlarz, M., Szemer\u00e9di, E.: A fast algorithm for equitable coloring. Combinatorica 30, 217\u2013224 (2010)","journal-title":"Combinatorica"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01918457","volume":"21","author":"D Br\u00e9laz","year":"1977","unstructured":"Br\u00e9laz, D., Nicolier, Y., de Werra, D.: Compactness and balancing in scheduling. Math. Methods Oper. Res. 21, 65\u201373 (1977)","journal-title":"Math. Methods Oper. Res."},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.11113\/jt.v19.1057","volume":"19","author":"GB Sulong","year":"1992","unstructured":"Sulong, G.B.: Some balanced colouring algorithms for examination timetabling. Jurnal Teknologi 19, 57\u201363 (1992)","journal-title":"Jurnal Teknologi"},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.dam.2011.10.008","volume":"164","author":"L Bahiense","year":"2014","unstructured":"Bahiense, L., Frota, Y., Noronha, T.F., Ribeiro, C.: A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives. Discrete Appl. Math. 164(1), 34\u201346 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"30_CR11","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.dam.2012.11.018","volume":"164","author":"I M\u00e9ndez D\u00edaz","year":"2014","unstructured":"M\u00e9ndez D\u00edaz, I., Nasini, G., Sever\u00edn, D.: A polyhedral approach for the equitable coloring problem. Discrete Appl. Math. 164(2), 413\u2013426 (2014)","journal-title":"Discrete Appl. Math."},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.endm.2013.10.044","volume":"44","author":"I M\u00e9ndez D\u00edaz","year":"2013","unstructured":"M\u00e9ndez D\u00edaz, I., Nasini, G., Sever\u00edn, D.: An exact DSatur-based algorithm for the equitable coloring problem. Electron. Notes Discrete Math. 44, 281\u2013286 (2013)","journal-title":"Electron. Notes Discrete Math."},{"issue":"4","key":"30_CR13","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."},{"issue":"9","key":"30_CR14","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. Comput. Oper. Res. 33(9), 2547\u20132562 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"30_CR15","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/BF02023611","volume":"5","author":"F Glover","year":"1985","unstructured":"Glover, F., McMillan, C., Novick, B.: Interactive decision software and computer graphics for architectural and space planning. Ann. Oper. Res. 5(3), 557\u2013573 (1985)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"30_CR16","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"},{"issue":"3","key":"30_CR17","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.cor.2006.05.014","volume":"35","author":"I Bl\u00f6chliger","year":"2008","unstructured":"Bl\u00f6chliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive tabu scheme. Comput. Oper. Res. 35(3), 960\u2013975 (2008)","journal-title":"Comput. Oper. Res."},{"key":"30_CR18","unstructured":"Graph Coloring Benchmark Instances. http:\/\/www.cs.hbg.psu.edu\/txn131\/graphcoloring.html"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T02:11:18Z","timestamp":1703211078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":18,"aliases":["10.1007\/978-3-319-14115-2_30"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}