{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:30:41Z","timestamp":1725471041175},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540463849"},{"type":"electronic","value":"9783540463856"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11890584_13","type":"book-chapter","created":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T12:30:32Z","timestamp":1159878632000},"page":"162-177","source":"Crossref","is-referenced-by-count":1,"title":["Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem"],"prefix":"10.1007","author":[{"given":"Marco","family":"Chiarandini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Graph coloring problems","author":"T.R. Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph coloring problems. Wiley Interscience, New York (1995)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W.K. Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment: Theory and applications. Proceedings of the IEEE\u00a068, 1497\u20131514 (1980)","journal-title":"Proceedings of the IEEE"},{"key":"13_CR3","first-page":"229","volume":"77","author":"B.A. Tesman","year":"1990","unstructured":"Tesman, B.A.: Set T-colorings. Congressus Numerantium\u00a077, 229\u2013242 (1990)","journal-title":"Congressus Numerantium"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","volume":"93","author":"F.S. Roberts","year":"1991","unstructured":"Roberts, F.S.: T-colorings of graphs: Recent results and open problems. Discrete Mathematics\u00a093, 229\u2013245 (1991)","journal-title":"Discrete Mathematics"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0166-218X(93)90015-G","volume":"45","author":"B.A. Tesman","year":"1993","unstructured":"Tesman, B.A.: List T-colorings. Discrete Applied Mathematics\u00a045, 277\u2013289 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0166-218X(02)00576-0","volume":"129","author":"K. Giaro","year":"2003","unstructured":"Giaro, K., Janczewski, R., Malafiejski, M.: The complexity of the T-coloring problem for graphs with small degree. Discrete Applied Mathematics\u00a0129, 361\u2013369 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.7151\/dmgt.1158","volume":"22","author":"A. Eisenbl\u00e4tter","year":"2002","unstructured":"Eisenbl\u00e4tter, A., Gr\u00f6tschel, M., Koster, A.M.C.A.: Frequency assignment and ramifications of coloring. Discussiones Mathematicae Graph Theory\u00a022, 51\u201388 (2002)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"13_CR8","unstructured":"Aardal, K.I., van Hoesel, C.P.M., Koster, A.M.C.A., Mannino, C., Sassano, A.: Models and solution techniques for the frequency assignment problem. ZIB-report 01\u201340, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Germany (2001)"},{"key":"13_CR9","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H. Hoos","year":"2004","unstructured":"Hoos, H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2004)"},{"key":"13_CR10","first-page":"77","volume-title":"Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"R. Dorne","year":"1998","unstructured":"Dorne, R., Hao, J.: Tabu search for graph coloring, T-colorings and set T-colorings. In: Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 77\u201392. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"13_CR11","unstructured":"Phan, V., Skiena, S.: Coloring graphs with a general heuristic search engine. In: Johnson, D.S., Mehrotra, A., Trick, M. (eds.) Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, Ithaca, New York, USA, pp. 92\u201399 (2002)"},{"key":"13_CR12","unstructured":"Prestwich, S.: Hybrid local search on two multicolouring models. In: International Symposium on Mathematical Programming, Copenhagen, Denmark (2003)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","first-page":"933","volume-title":"Selected Areas in Cryptography","author":"A. Lim","year":"2006","unstructured":"Lim, A., Zhu, Y., Lou, Q., Rodrigues, B.: Heuristic methods for graph coloring problems. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 933\u2013939. Springer, Heidelberg (2006)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","first-page":"31","volume-title":"Principles and Practice of Constraint Programming - CP \u201995","author":"J. Culberson","year":"1995","unstructured":"Culberson, J., Beacham, A., Papp, D.: Hiding our colors. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol.\u00a0976, pp. 31\u201342. Springer, Heidelberg (1995)"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1109\/TCOM.1973.1091583","volume":"21","author":"L.G. Anderson","year":"1973","unstructured":"Anderson, L.G.: A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system. IEEE Transactions on Communications\u00a021, 1294\u20131301 (1973)","journal-title":"IEEE Transactions on Communications"},{"key":"13_CR16","unstructured":"Chiarandini, M.: Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems. PhD thesis, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany (2005)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1029\/97RS01866","volume":"32","author":"S. Hurley","year":"1997","unstructured":"Hurley, S., Smith, D.H., Thiel, S.U.: FASoft: A system for discrete channel frequency assignment. Radio Science\u00a032, 1921\u20131939 (1997)","journal-title":"Radio Science"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"Fleurent, C., Ferland, J.: Genetic and hybrid algorithms for graph coloring. Annals of Operations Research\u00a063, 437\u2013464 (1996)","journal-title":"Annals of Operations Research"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization\u00a03, 379\u2013397 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02023000","volume":"41","author":"D. Costa","year":"1993","unstructured":"Costa, D.: On the use of some known methods for T-colorings of graphs. Annals of Operations Research\u00a041, 343\u2013358 (1993)","journal-title":"Annals of Operations Research"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF02125459","volume":"63","author":"D. Castelino","year":"1996","unstructured":"Castelino, D., Hurley, S., Stephens, N.: A tabu search algorithm for frequency assignment. Annals of Operations Research\u00a063, 301\u2013320 (1996)","journal-title":"Annals of Operations Research"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1023\/A:1009690321348","volume":"4","author":"J.K. Hao","year":"1998","unstructured":"Hao, J.K., Dorne, R., Galinier, P.: Tabu search for frequency assignment in mobile radio networks. Journal of Heuristics\u00a04, 47\u201362 (1998)","journal-title":"Journal of Heuristics"},{"key":"13_CR23","unstructured":"Hao, J.K., Perrier, L.: Tabu search for the frequency assignment problem in cellular radio networks. Technical Report LGI2P, EMA-EERIE, Parc Scientifique Georges Besse, Nimes, France (1999)"},{"key":"13_CR24","unstructured":"Birattari, M.: The race package for R. Racing methods for the selection of the best. Technical Report TR\/IRIDIA\/2003-37, IRIDIA, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium (2003)"},{"key":"13_CR25","volume-title":"Practical Nonparametric Statistics","author":"W. Conover","year":"1999","unstructured":"Conover, W.: Practical Nonparametric Statistics. John Wiley & Sons, New York (1999)"},{"key":"13_CR26","unstructured":"Chiarandini, M., Basso, D., St\u00fctzle, T.: Statistical methods for the comparison of stochastic optimizers. In: Doerner, K.F., et al. (eds.) MIC 2005: The Sixth Metaheuristics International Conference, Vienna, Austria, pp. 189\u2013196 (2005)"},{"key":"13_CR27","first-page":"1359","volume-title":"Proc. of GECCO-2001 (Genetic and Evolutionary Computation Conference)","author":"S. Matsui","year":"2001","unstructured":"Matsui, S., Tokoro, K.: Improving the performance of a genetic algorithm for minimum span frequency assignment problem with an adaptive mutation rate and a new initialization method. In: Proc. of GECCO-2001 (Genetic and Evolutionary Computation Conference), pp. 1359\u20131366. Morgan Kaufmann Publishers, San Francisco (2001)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11890584_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:31:40Z","timestamp":1619508700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11890584_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540463849","9783540463856"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11890584_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}