{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T22:33:46Z","timestamp":1726007626551},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T00:00:00Z","timestamp":1167350400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T00:00:00Z","timestamp":1167350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1007\/s10878-006-9036-2","type":"journal-article","created":{"date-parts":[[2006,12,28]],"date-time":"2006-12-28T19:27:06Z","timestamp":1167334026000},"page":"9-33","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem"],"prefix":"10.1007","volume":"14","author":[{"given":"Vincenzo","family":"Cutello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Nicosia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Pavone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,12,29]]},"reference":[{"key":"9036_CR1","doi-asserted-by":"crossref","unstructured":"Ausiello G. Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M (1999) Complexity and approximation. Springer-Verlag","DOI":"10.1007\/978-3-642-58412-1"},{"key":"9036_CR2","unstructured":"Barbosa VC, Assis CAG, do Nascimento JO (to appear) Two novel evolutionary formulations of the graph coloring problem. J Combin Optim"},{"key":"9036_CR3","doi-asserted-by":"crossref","unstructured":"Bollobas B (1998) Modern graph theory. Graduate texts in mathematics, vol. 184. Springer-Verlag, Berlin Heidelberg New York","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"9036_CR4","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks RL (1941) On colouring the nodes of a network. Cambridge Phil Soc 37:194\u2013197","journal-title":"Cambridge Phil Soc"},{"key":"9036_CR5","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1002\/nav.1033","volume":"48","author":"M Caramia","year":"2001","unstructured":"Caramia M, Dell'Olmo P (2001) Iterative coloring extension of a maximum clique. Naval Res Logis 48:518\u2013550","journal-title":"Naval Res Logis"},{"key":"9036_CR6","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/88616.88621","volume":"12","author":"FC Chow","year":"1990","unstructured":"Chow FC, Hennessy JL (1990) The priority-based coloring approach to register allocation. ACM Trans Program Languages Syst 12:501\u2013536","journal-title":"ACM Trans Program Languages Syst"},{"key":"9036_CR7","doi-asserted-by":"crossref","unstructured":"Culberson JC, Luo F (1996) Exploring the k-colorable landscape with iterated greedy. Cliques, coloring and satisfiability: second DIMACS implementation challenge. American Mathematical Society, Providence, RI, pp 245\u2013284","DOI":"10.1090\/dimacs\/026\/13"},{"key":"9036_CR8","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-31996-2_8","volume":"3448","author":"V Cutello","year":"2005","unstructured":"Cutello V, Morelli G, Nicosia G, Pavone M (2005) Immune algorithms with aging operators for the string folding problem and the protein folding problem. Lecture Notes Comput Sci 3448:80\u201390","journal-title":"Lecture Notes Comput Sci"},{"key":"9036_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-30220-9_22","volume":"3239","author":"V Cutello","year":"2004","unstructured":"Cutello V, Nicosia G, Pavone M (2004) Exploring the capability of immune algorithms: a characterization of hypermutation operators. Lecture Notes Comput Sci 3239:263\u2013276","journal-title":"Lecture Notes Comput Sci"},{"key":"9036_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11536444_2","volume":"3627","author":"V Cutello","year":"2005","unstructured":"Cutello V, Narzisi G, Nicosia G, Pavone M (2005) Clonal selection algorithms: a comparative case study using effective mutation potentials. Lecture Notes Comput Sci 3627:13\u201328","journal-title":"Lecture Notes Comput Sci"},{"key":"9036_CR11","doi-asserted-by":"crossref","unstructured":"Cutello V, Narzisi G, Nicosia G, Pavone M (2005) An immunological algorithm for global numerical optimization. In: Proc. of the seventh international conference on artificial evolution (EA'05). To appear","DOI":"10.1007\/11740698_25"},{"key":"9036_CR12","doi-asserted-by":"crossref","unstructured":"Cutello V, Nicosia G, Pavone M (2003) A hybrid immune algorithm with information gain for the graph coloring problem. In: Proceedings of genetic and evolutionary computation conference (GECCO) vol. 2723. Springer, pp 171\u2013182","DOI":"10.1007\/3-540-45105-6_23"},{"key":"9036_CR13","doi-asserted-by":"crossref","unstructured":"Cutello V, Nicosia G, Pavone M (2004) An immune algorithm with hyper-macromutations for the Dill's 2D hydrophobic-hydrophilic model. Congress on Evolutionary Computation, vol. 1. IEEE Press, pp 1074\u20131080","DOI":"10.1109\/CEC.2004.1330981"},{"key":"9036_CR14","unstructured":"Dasgupta D (ed) (1999) Artificial immune systems and their applications. Springer-Verlag, Berlin Heidelberg New York"},{"key":"9036_CR15","volume-title":"Artificial immune systems: a new computational intelligence paradigm","author":"LN De Castro","year":"2002","unstructured":"De Castro LN, Timmis J (2002) Artificial immune systems: a new computational intelligence paradigm. Springer-Verlag, UK"},{"key":"9036_CR16","unstructured":"De Castro LN, Von Zuben FJ (2000) The clonal selection algorithm with engineering applications. In: Proceedings of GECCO 2000, workshop on artificial immune systems and their applications, pp 36\u201337"},{"issue":"3","key":"9036_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/TEVC.2002.1011539","volume":"6","author":"LN De Castro","year":"2002","unstructured":"De Castro LN, Von Zuben FJ (2002) Learning and optimization using the clonal selection principle. IEEE Trans Evolut Comput 6(3):239\u2013251","journal-title":"IEEE Trans Evolut Comput"},{"key":"9036_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D de Werra","year":"1985","unstructured":"de Werra D (1985) An introduction to timetabling. European J Oper Res 19:151\u2013162","journal-title":"European J Oper Res"},{"key":"9036_CR19","unstructured":"Diestel R (1997) Graph theory. Graduate texts in mathematics, vol. 173. Springer-Verlag, Berlin Heidelberg New York"},{"issue":"2","key":"9036_CR20","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"AE Eiben","year":"1999","unstructured":"Eiben AE, Hinterding R, Michalewicz Z (1999) Parameter control in evolutionary algorithms. IEEE Trans Evolut Comput 3(2):124\u2013141","journal-title":"IEEE Trans Evolut Comput"},{"key":"9036_CR21","doi-asserted-by":"crossref","unstructured":"Fleurent C, Ferland JA (1996) Object-oriented implementation of heuristic search methods for graph coloring, maximum clique and satisfability. Cliques, coloring and satisfiability: second DIMACS implementation challenge. American Mathematical Society, Providence, RI, pp 619\u2013652","DOI":"10.1090\/dimacs\/026\/29"},{"key":"9036_CR22","volume-title":"Immunology as information processing. Design principles for immune system & other distributed autonomous systems","author":"S Forrest","year":"2000","unstructured":"Forrest S, Hofmeyr SA (2000) Immunology as information processing. Design principles for immune system & other distributed autonomous systems. Oxford Univ. Press, New York"},{"issue":"4","key":"9036_CR23","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P Galinier","year":"1999","unstructured":"Galinier P, Hao J (1999) Hybrid evolutionary algorithms for graph coloring. J Comb Optim 3(4):379\u2013397","journal-title":"J Comb Optim"},{"key":"9036_CR24","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02309111","volume":"22","author":"F Galvin","year":"1991","unstructured":"Galvin F, Komj\u00e1th P (1991) Graph colorings and the axiom of the choice. Period Math Hungar 22:71\u201375","journal-title":"Period Math Hungar"},{"key":"9036_CR25","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/T-VT.1986.24063","volume":"35","author":"A Gamst","year":"1986","unstructured":"Gamst A (1986) Some lower bounds for a class of frequency assignment problems. IEEE Trans Vehicular Techn 35:8\u201314","journal-title":"IEEE Trans Vehicular Techn"},{"key":"9036_CR26","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","volume":"23","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, So HC (1976) An application of graph coloring to printed circuit testing. IEEE Trans Circ Syst CAS-23:591\u2013599","journal-title":"IEEE Trans Circ Syst CAS-"},{"key":"9036_CR27","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"key":"9036_CR28","doi-asserted-by":"crossref","unstructured":"Garrett SM (2005) How do we evaluate artificial immune systems, vol. 13, no. 2 ? Evolutionary Computation, Mit Press, pp 145\u2013178","DOI":"10.1162\/1063656054088512"},{"issue":"3","key":"9036_CR29","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1027312403532","volume":"7","author":"CA Glass","year":"2003","unstructured":"Glass CA, Pr\u00fcgel-Bennet A (2003) Genetic algorithm for graph coloring: exploration of galinier and hao's algorithm. J Combinat Optim 7(3):229\u2013236","journal-title":"J Combinat Optim"},{"key":"9036_CR30","doi-asserted-by":"crossref","unstructured":"Glover F, Parker M, Ryan J (1996) Coloring by Tabu branch and bound. Cliques, coloring and satisfiability: second DIMACS implementation challenge. American Mathematical Society, Providence, RI, pp 285\u2013307","DOI":"10.1090\/dimacs\/026\/14"},{"key":"9036_CR31","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0020-0190(93)90246-6","volume":"45","author":"MM Halld\u00f3rsson","year":"1993","unstructured":"Halld\u00f3rsson MM (1993) A still better performance guarantee for approximate graph coloring. Inf Proc Lett 45:19\u201323","journal-title":"Inf Proc Lett"},{"key":"9036_CR32","doi-asserted-by":"crossref","unstructured":"Hamiez J, Hao J (2003) An analysis of solution properties of the graph coloring problem. Metaheuristics: Computer Decision-Making. Kluwer, Chapter 15, pp 325\u2013326","DOI":"10.1007\/978-1-4757-4137-7_15"},{"key":"9036_CR33","doi-asserted-by":"crossref","unstructured":"Jaynes ET (2003) Probability theory: the logic of science. Cambridge University Press","DOI":"10.1017\/CBO9780511790423"},{"key":"9036_CR34","unstructured":"Jensen TR, Toft B (1995) Graphs coloring problems. Wiley-Interscience Series in Discrete Mathematics and Optimization"},{"key":"9036_CR35","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"DR Johnson","year":"1991","unstructured":"Johnson DR, Aragon CR, McGeoch LA, Schevon C (1991) Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning. Oper Res 39:378\u2013406","journal-title":"Oper Res"},{"key":"9036_CR36","doi-asserted-by":"crossref","unstructured":"Johnson DS, Trick MA (eds) (1996) Cliques, coloring and satisfiability: second DIMACS implementation challenge. Am Math Soc, Providence, RI","DOI":"10.1090\/dimacs\/026"},{"key":"9036_CR37","volume-title":"Statistics and information theory","author":"S Kullback","year":"1959","unstructured":"Kullback S (1959) Statistics and information theory. J. Wiley and Sons, New York"},{"key":"9036_CR38","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"FT Leighton","year":"1979","unstructured":"Leighton FT (1979) A graph coloring algorithm for large scheduling problems. J Res National Bureau Standard 84:489\u2013505","journal-title":"J Res National Bureau Standard"},{"issue":"1","key":"9036_CR39","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/4235.910461","volume":"5","author":"K Leung","year":"2001","unstructured":"Leung K, Duan Q, Xu Z, Wong CW (2001) A new model of simulated evolutionary computation\u2014convergence analysis and specifications. IEEE Trans Evolut Comput 5(1):3\u201316","journal-title":"IEEE Trans Evolut Comput"},{"key":"9036_CR40","doi-asserted-by":"crossref","unstructured":"Lewandowski G, Condon A (1996) Experiments with parallel graph coloring heuristics and applications of graph coloring. Cliques, coloring and satisfiability: second DIMACS implementation challenge. American Mathematical Society, Providence, RI, pp 309\u2013334","DOI":"10.1090\/dimacs\/026\/15"},{"key":"9036_CR41","unstructured":"Marino A, Damper RI (2000) Breaking the symmetry of the graph colouring problem with genetic algorithms. Workshop proc. of the genetic and evolutionary computation conference (GECCO'00). Morgan Kaufmann, Las Vegas, NV"},{"key":"9036_CR42","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A Mehrotra","year":"1996","unstructured":"Mehrotra A, Trick MA (1996) A column generation approach for graph coloring. INFORMS J Comput 8:344\u2013354","journal-title":"INFORMS J Comput"},{"key":"9036_CR43","doi-asserted-by":"crossref","unstructured":"Morgenstern C (1996) Distributed coloration neighborhood search. Cliques, coloring and satisfiability: second DIMACS implementation challenge. American Mathematical Society, Providence, RI, pp 335\u2013357","DOI":"10.1090\/dimacs\/026\/16"},{"key":"9036_CR44","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1078\/1431-7613-00032","volume":"120","author":"G Nicosia","year":"2001","unstructured":"Nicosia G, Castiglione F, Motta S (2001) Pattern recognition by primary and secondary response of an artificial immune system. Theory Biosci 120:93\u2013106","journal-title":"Theory Biosci"},{"key":"9036_CR45","unstructured":"Nicosia G, Castiglione F, Motta S (2001) Pattern recognition with a multi-agent model of the immune system. Int. NAISO symposium (ENAIS'2001). ICSC Academic Press, Dubai, UAE, pp 788\u2013794"},{"key":"9036_CR46","unstructured":"Nicosia G, Cutello V (2002) Multiple learning using immune algorithms. In: Proceedings of the 4th international conference on recent advances in soft computing. RASC, Nottingham, UK"},{"key":"9036_CR47","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0022-5193(05)80737-4","volume":"158","author":"PE Seiden","year":"1992","unstructured":"Seiden PE, Celada F (1992) A model for simulating cognate recognition and response in the immune system. J Theor Biol 158:329\u2013357","journal-title":"J Theor Biol"},{"key":"9036_CR48","doi-asserted-by":"crossref","unstructured":"Shannon CE (2004) A mathematical theory of communication. Congress on evolutionary computation, vol. 1. IEEE Press, pp 1074\u20131080 Bell System Technical Journal, vol. 27, pp 379\u2013423 and 623\u2013656 (1948)","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"9036_CR49","unstructured":"Sivia DS (1996) Data analysis. A Bayesian Tutorial. Oxford Science Publications"},{"key":"9036_CR50","unstructured":"Tsang EPK (1993) Foundations of constraint satisfaction, vol. 37. Academic Press"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9036-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-006-9036-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9036-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9036-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T22:27:42Z","timestamp":1652826462000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-006-9036-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,29]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["9036"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-9036-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,29]]},"assertion":[{"value":"29 December 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}