{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:44:15Z","timestamp":1761662655831},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850670"},{"type":"electronic","value":"9783540850687"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85068-7_16","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T22:33:14Z","timestamp":1220999594000},"page":"389-417","source":"Crossref","is-referenced-by-count":1,"title":["A Decomposed Approach for the Minimum Interference Frequency Assignment"],"prefix":"10.1007","author":[{"given":"Gualtiero","family":"Colombo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stuart M.","family":"Allen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"FAP web - A website about Frequency Assignment Problems (2007), \n                    \n                      http:\/\/fap.zib.de\/\n                    \n                    \n                   (accessed on June 1, 2007)"},{"key":"16_CR2","volume-title":"Frequency assignment problems: benchmarks and lower bounds","author":"S.M. Allen","year":"1998","unstructured":"Allen, S.M., Dunkin, N., Hurley, S., Smith, D.: Frequency assignment problems: benchmarks and lower bounds. University of Glamorgan, UK (1998)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Brandes, U., Gaertler, M., Wagner, D.: Experiments on Graph Clustering Algorithms. In: Proc. of the 11th Annual European Symposium on Algorithms, Budapest (2003)","DOI":"10.1007\/978-3-540-39658-1_52"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1504\/IJMNDI.2006.010812","volume":"1-2","author":"G. Colombo","year":"2006","unstructured":"Colombo, G.: A Genetic Algorithm for frequency assignment with problem decomposition. International Journal of Mobile Network Design and Innovation\u00a01-2, 102\u2013112 (2006)","journal-title":"International Journal of Mobile Network Design and Innovation"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Colombo, G., Allen, S.M.: Problem decomposition for Minimum Interference Frequency Assignment. In: Proc. of the IEEE Congress in and Evolutionary Computation, Singapore (2007)","DOI":"10.1109\/CEC.2007.4424925"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Colombo, G., Mumford, C.L.: Comparing Algorithms, Representations and Operators for the Multi\u2013objective Knapsack Problem. In: Proceedings of the 2005 IEEE Congress on Evolutionary Computation (CEC 2005), Edinburgh, Scotland, pp. 1268\u20131275 (2005)","DOI":"10.1109\/CEC.2005.1554836"},{"volume-title":"Wireless Flexible Personalised Communications","year":"2001","key":"16_CR7","unstructured":"Correia, L.M. (ed.): Wireless Flexible Personalised Communications. Wiley, Chichester (2001)"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K. Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA\u2013II. IEE Trans. on Evolutionary Computation\u00a06, 182\u2013197 (2002)","journal-title":"IEE Trans. on Evolutionary Computation"},{"key":"16_CR9","unstructured":"Eisenblatter, A.: Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds. PhD thesis, Technische Universitat Berlin, Berlin, Germany (2001)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/T-VT.1986.24063","volume":"35","author":"A. Gamst","year":"1986","unstructured":"Gamst, A.: Some lower bounds for a class of frequency assignment problems. IEEE Transactions on Vehicular Technology\u00a035, 8\u201314 (1986)","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"16_CR11","unstructured":"Grace, D., Burr, A.G., Tozer, T.C.: Comparison of Different Distributed Channel Assignment Algorithms for UFDMA. In: 2nd IEEE International Conference on Personal, Mobile and Spread Spectrum Communications, pp. 38\u201341 (1996)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"38","author":"W.K. Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment: Theory and applications. Proc. IEEE\u00a038, 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Hale, W.K.: New spectrum management tools. In: Proc. Ieee International Symposium on Electromagnetic Compatibility, pp. 47\u201353 (1981)","DOI":"10.1109\/ISEMC.1981.7569900"},{"key":"16_CR14","volume-title":"Methods and algorithms for radio channel assignment","author":"S. Hurley","year":"2002","unstructured":"Hurley, S., Smith, D.: Meta-Heuristics and channel assignment. In: Hurley, S., Leese, R. (eds.) Methods and algorithms for radio channel assignment. Oxford University Press, Oxford (2002)"},{"issue":"5","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1029\/97RS01866","volume":"32","author":"S. Hurley","year":"1997","unstructured":"Hurley, S., Smith, D., Thiel, S.U.: Fasoft: a system for discrete channel frequency assignment. Radio Science\u00a032(5), 1921\u20131939 (1997)","journal-title":"Radio Science"},{"key":"16_CR16","unstructured":"Karaoglu, N., Manderick, B.: FAPSTER - a genetic algorithm for frequency assignment problem. In: Proc. of the 2005 Genetic and Evolutionary Computation Conference, Washington D.C., USA (2005)"},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1002\/net.10046","volume":"40","author":"A.M.C.A. Koster","year":"2002","unstructured":"Koster, A.M.C.A., van Hoesel, C.P.M., Kolen, A.W.J.: Solving partial constraint satisfaction problems with tree decomposition. Networks\u00a040(3), 170\u2013180 (2002)","journal-title":"Networks"},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(02)00239-1","volume":"129","author":"C. Mannino","year":"2003","unstructured":"Mannino, C., Sassano, A.: An enumerative algorithm for the frequency assignment problem. Discrete Applied Mathematics\u00a0129(1), 155\u2013169 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"16_CR19","unstructured":"Mannino, C., Oriolo, G., Ricci, F.: Solving Stability Problems on a Superclass of Interval Graphs. T.R. n. 511, Vito Volterra (2002)"},{"issue":"3","key":"16_CR20","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1109\/TVT.2003.810976","volume":"52","author":"R. Montemanni","year":"2003","unstructured":"Montemanni, R., Moon, J.N., Smith, D.H.: An improved Tabu Search algorithm for the Fixed-Spectrum Frequency-Assignment problem. IEE Transactions on Vehicular technology\u00a052(3), 891\u2013901 (2003)","journal-title":"IEE Transactions on Vehicular technology"},{"key":"16_CR21","volume-title":"High Performance Algorithms and Software in Nonlinear Optimization","author":"P. Pardalos","year":"1998","unstructured":"Pardalos, P., Rappe, J., Resende, M.: An exact parallel algorithm for the maximum clique problem. In: De Leone, P.P.R., Murl\u2019i, A., Toraldo, G. (eds.) High Performance Algorithms and Software in Nonlinear Optimization. Kluwer, Dordrecht (1998)"},{"key":"16_CR22","unstructured":"van Dongen, S.: A cluster algorithm for graphs, Technical Report INS-R0010, National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam (2000)"},{"key":"16_CR23","unstructured":"Waharte, S., Boutaba, R.: Comparison of Distributed Frequency Assignment Algorithms for Wireless Sensor Network, Technical Report, University of Waterloo, ON, Canada"}],"container-title":["Studies in Computational Intelligence","Linkage in Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85068-7_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:39:21Z","timestamp":1619509161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85068-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850670","9783540850687"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85068-7_16","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[]}}