{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:01:19Z","timestamp":1765231279479,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031162091"},{"type":"electronic","value":"9783031162107"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-16210-7_51","type":"book-chapter","created":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T23:03:09Z","timestamp":1663714989000},"page":"627-639","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Unfeasible Space Exploring Matheuristic Proposal to\u00a0Solve the\u00a0Sum Coloring Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8176-0698","authenticated-orcid":false,"given":"Olfa","family":"Harrabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5240-7270","authenticated-orcid":false,"given":"Jouhaina Chaouachi","family":"Siala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"issue":"2","key":"51_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/inco.1997.2677","volume":"140","author":"A Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., Bellare, M., Halld\u00f3rsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comput. 140(2), 183\u2013202 (1998)","journal-title":"Inf. Comput."},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Halld\u00f3rsson, M., Kortsarz, G., Salman, R., Shanhnai, H.: Sum multi-coloring of graphs. In: Algorithms-ESA\u201999, pp. 693\u2013693 (1999)","DOI":"10.1007\/3-540-48481-7_34"},{"issue":"2","key":"51_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1006\/jagm.1998.0938","volume":"28","author":"A Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., Kortsarz, G.: Minimum color sum of bipartite graphs. J. Algorithms 28(2), 339\u2013365 (1998)","journal-title":"J. Algorithms"},{"key":"51_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-34859-4_13","volume-title":"Simulated Evolution and Learning","author":"U Benlic","year":"2012","unstructured":"Benlic, U., Hao, J.-K.: A study of breakout local search for the minimum sum coloring problem. In: Bui, L.T., Ong, Y.S., Hoai, N.X., Ishibuchi, H., Suganthan, P.N. (eds.) SEAL 2012. LNCS, vol. 7673, pp. 128\u2013137. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34859-4_13"},{"issue":"2","key":"51_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00373-005-0645-9","volume":"22","author":"A Berliner","year":"2006","unstructured":"Berliner, A., Bostelmann, U., Brualdi, R.A., Deaett, L.: Sum list coloring graphs. Graphs Combinatorics 22(2), 173\u2013183 (2006)","journal-title":"Graphs Combinatorics"},{"key":"51_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-04918-7_13","volume-title":"Hybrid Metaheuristics","author":"MA Boschetti","year":"2009","unstructured":"Boschetti, M.A., Maniezzo, V., Roffilli, M., Boluf\u00e9 R\u00f6hler, A.: Matheuristics: Optimization, Simulation and Control. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 171\u2013177. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04918-7_13"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Bouziri, H., Harrabi, O.: Behavior study of genetic operators for the minimum sum coloring problem. In: 2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO), pp. 1\u20136. IEEE (2013)","DOI":"10.1109\/ICMSAO.2013.6552608"},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1016\/j.endm.2010.05.116","volume":"36","author":"H Bouziri","year":"2010","unstructured":"Bouziri, H., Jouini, M.: A tabu search approach for the sum coloring problem. Electron. Notes Discrete Math. 36, 915\u2013922 (2010)","journal-title":"Electron. Notes Discrete Math."},{"issue":"4","key":"51_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"},{"issue":"2","key":"51_CR10","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/S0377-2217(87)80148-0","volume":"32","author":"M Chams","year":"1987","unstructured":"Chams, M., Hertz, A., De Werra, D.: Some experiments with simulated annealing for coloring graphs. Eur. J. Oper. Res. 32(2), 260\u2013266 (1987)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"51_CR11","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":"3","key":"51_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00453-003-1031-8","volume":"37","author":"MM Halld\u00f3rsson","year":"2003","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Shachnai, H.: Sum coloring interval and k-claw free graphs with application to scheduling dependent jobs. Algorithmica 37(3), 187\u2013209 (2003)","journal-title":"Algorithmica"},{"issue":"1","key":"51_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1080\/0952813X.2019.1620869","volume":"32","author":"O Harrabi","year":"2020","unstructured":"Harrabi, O., Chaouachi, J.: Towards effective resolution approaches for solving the sum coloring problem. J. Exp. Theor. Artif. Intell. 32(1), 31\u201357 (2020)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"51_CR14","doi-asserted-by":"crossref","unstructured":"Harrabi, O., Fatnassi, E., Bouziri, H., Chaouachi, J.: A bi-objective memetic algorithm proposal for solving the minimum sum coloring problem. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 27\u201328 (2017)","DOI":"10.1145\/3067695.3082035"},{"key":"51_CR15","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-981-13-1592-3_8","volume-title":"Soft Computing for Problem Solving","author":"O Harrabi","year":"2019","unstructured":"Harrabi, O., Siala, J.C.: An effective parameter tuning for a bi-objective genetic algorithm to solve the sum coloring problem. In: Bansal, J.C., Das, K.N., Nagar, A., Deep, K., Ojha, A.K. (eds.) Soft Computing for Problem Solving. AISC, vol. 816, pp. 107\u2013119. Springer, Singapore (2019). https:\/\/doi.org\/10.1007\/978-981-13-1592-3_8"},{"key":"51_CR16","unstructured":"Helmar, A., Chiarandini, M.: A local search heuristic for chromatic sum. In: Proceedings of the 9th Metaheuristics International Conference, vol. 1101, pp. 161\u2013170 (2011)"},{"issue":"3","key":"51_CR17","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10462-016-9485-7","volume":"47","author":"Y Jin","year":"2016","unstructured":"Jin, Y., Hamiez, J.-P., Hao, J.-K.: Algorithms for the minimum sum coloring problem: a review. Artif. Intell. Rev. 47(3), 367\u2013394 (2016). https:\/\/doi.org\/10.1007\/s10462-016-9485-7","journal-title":"Artif. Intell. Rev."},{"key":"51_CR18","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ins.2016.02.051","volume":"352","author":"Y Jin","year":"2016","unstructured":"Jin, Y., Hao, J.K.: Hybrid evolutionary search for the minimum sum coloring problem of graphs. Inf. Sci. 352, 15\u201334 (2016)","journal-title":"Inf. Sci."},{"key":"51_CR19","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.cor.2013.09.019","volume":"43","author":"Y Jin","year":"2014","unstructured":"Jin, Y., Hao, J.K., Hamiez, J.P.: A memetic algorithm for the minimum sum coloring problem. Comput. Oper. Res. 43, 318\u2013327 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"51_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.dam.2007.10.007","volume":"156","author":"DS Johnson","year":"2008","unstructured":"Johnson, D.S., Mehrotra, A., Trick, M.A.: Preface: special issue on computational methods for graph coloring and its generalizations. Discret. Appl. Math. 156(2), 145\u2013146 (2008)","journal-title":"Discret. Appl. Math."},{"key":"51_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-71618-1_24","volume-title":"Adaptive and Natural Computing Algorithms","author":"Z Kokosi\u0144ski","year":"2007","unstructured":"Kokosi\u0144ski, Z., Kwarciany, K.: On sum coloring of graphs with parallel genetic algorithms. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds.) ICANNGA 2007. LNCS, vol. 4431, pp. 211\u2013219. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71618-1_24"},{"key":"51_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-62559-3_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"LG Kroon","year":"1997","unstructured":"Kroon, L.G., Sen, A., Deng, H., Roy, A.: The optimal cost chromatic partition problem for trees and interval graphs. In: d\u2019Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds.) WG 1996. LNCS, vol. 1197, pp. 279\u2013292. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62559-3_23"},{"key":"51_CR23","doi-asserted-by":"crossref","unstructured":"Kubicka, E., Schwenk, A.J.: An introduction to chromatic sums. In: Proceedings of the 17th Conference on ACM Annual Computer Science Conference, pp. 39\u201345. ACM (1989)","DOI":"10.1145\/75427.75430"},{"key":"51_CR24","unstructured":"Li, Y., Lucet, C., Moukrim, A., Sghiouer, K.: Greedy algorithms for the minimum sum coloring problem. In: Logistique et transports, pp. LT-027 (2009)"},{"issue":"12","key":"51_CR25","doi-asserted-by":"publisher","first-page":"15244","DOI":"10.1016\/j.eswa.2011.05.075","volume":"38","author":"SW Lin","year":"2011","unstructured":"Lin, S.W., Vincent, F.Y., Lu, C.C.: A simulated annealing heuristic for the truck and trailer routing problem with time windows. Expert Syst. Appl. 38(12), 15244\u201315252 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"6","key":"51_CR26","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"key":"51_CR27","unstructured":"Moukrim, A., Sghiouer, K., Lucet, C., Li, Y.: Upper and lower bounds for the minimum sum coloring problem (2014)"},{"key":"51_CR28","doi-asserted-by":"publisher","first-page":"57891","DOI":"10.1109\/ACCESS.2020.2973122","volume":"8","author":"M Mrad","year":"2020","unstructured":"Mrad, M., Harrabi, O., Siala, J.C., Gharbi, A.: A column generation-based lower bound for the minimum sum coloring problem. IEEE Access 8, 57891\u201357904 (2020)","journal-title":"IEEE Access"},{"key":"51_CR29","unstructured":"Schaffer, J.D.: Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of the First International Conference on Genetic Algorithms and Their Applications, 1985. Lawrence Erlbaum Associates. Inc. (1985)"},{"issue":"2","key":"51_CR30","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0020-0190(92)90017-P","volume":"43","author":"A Sen","year":"1992","unstructured":"Sen, A., Deng, H., Guha, S.: On a graph partition problem with application to vlsi layout. Inf. Process. Lett. 43(2), 87\u201394 (1992)","journal-title":"Inf. Process. Lett."},{"key":"51_CR31","doi-asserted-by":"crossref","unstructured":"Talbi, E.G.: A unified taxonomy of hybrid metaheuristics with mathematical programming, constraint programming and machine learning. In: Talbi, EG. (eds) Hybrid Metaheuristics. Studies in Computational Intelligence, vol 434, pp. 3\u201376. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-30671-6_1"},{"issue":"7","key":"51_CR32","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1016\/j.cor.2011.09.010","volume":"39","author":"Q Wu","year":"2012","unstructured":"Wu, Q., Hao, J.K.: An effective heuristic algorithm for sum coloring of graphs. Comput. Oper. Res. 39(7), 1593\u20131600 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"51_CR33","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/TAC.1963.1105511","volume":"8","author":"L Zadeh","year":"1963","unstructured":"Zadeh, L.: Optimality and non-scalar-valued performance criteria. IEEE Trans. Autom. Control 8(1), 59\u201360 (1963)","journal-title":"IEEE Trans. Autom. Control"}],"container-title":["Communications in Computer and Information Science","Advances in Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16210-7_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T06:07:44Z","timestamp":1728022064000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16210-7_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031162091","9783031162107"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16210-7_51","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}