{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:41:51Z","timestamp":1743021711495,"version":"3.40.3"},"publisher-location":"Cham","reference-count":65,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319051697"},{"type":"electronic","value":"9783319051703"}],"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-05170-3_34","type":"book-chapter","created":{"date-parts":[[2014,3,26]],"date-time":"2014-03-26T13:53:08Z","timestamp":1395841988000},"page":"493-507","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Characterization of the Optimization Process"],"prefix":"10.1007","author":[{"given":"Marcela","family":"Quiroz","sequence":"first","affiliation":[]},{"given":"Laura","family":"Cruz-Reyes","sequence":"additional","affiliation":[]},{"given":"Jose","family":"Torres-Jimenez","sequence":"additional","affiliation":[]},{"given":"Claudia G\u00f3mez","family":"Santill\u00e1n","sequence":"additional","affiliation":[]},{"given":"H\u00e9ctor J. Fraire","family":"Huacuja","sequence":"additional","affiliation":[]},{"given":"Patricia","family":"Melin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,27]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for optimizations. IEEE Trans. Evol. Comput. 1, 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"34_CR2","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles, K., Lopes, L.: Measuring instance difficulty for combinatorial optimization problems. Comput. Oper. Res. 39(5), 875\u2013889 (2012)","journal-title":"Comput. Oper. Res."},{"key":"34_CR3","unstructured":"Smyth, K.: Understanding stochastic local search algorithms: an empirical analysis of the relationship between search space structure and algorithm behaviour. The University of British Columbia, Ms. thesis (2004)"},{"key":"34_CR4","unstructured":"Garey, M., Jonson, D.: Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, a classic introduction to the field (1979)"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K., James, R., Giffin, J., Tu, Y.: Understanding the relationship between scheduling problem structure and heuristic performance using knowledge discovery. In: Learning and Intelligent Optimization, LION 3 (2009)","DOI":"10.1007\/978-3-642-11169-3_7"},{"key":"34_CR6","first-page":"556","volume":"2470","author":"K Leyton-Brown","year":"2002","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Learning the empirical hardness of optimization problems: The case of combinatorial auctions. Principles Pract. Constraint Program. 2470, 556\u2013572 (2002)","journal-title":"Principles Pract. Constraint Program."},{"key":"34_CR7","first-page":"438","volume":"3258","author":"E Nudelman","year":"2004","unstructured":"Nudelman, E., Devkar, A., Shoham, Y., Leyton-Brown, K.: Understanding random SAT: Beyond the clauses-to-variables ratio. Principles Pract. Constraint Program. 3258, 438\u2013452 (2004)","journal-title":"Principles Pract. Constraint Program."},{"issue":"3\u20134","key":"34_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10472-006-9036-z","volume":"47","author":"M Gagliolo","year":"2007","unstructured":"Gagliolo, M., Schmidhuber, J.: Learning dynamic algorithm portfolios. Spec. Issue Ann. Math. Artif. Intell. 47(3\u20134), 295\u2013328 (2007)","journal-title":"Spec. Issue Ann. Math. Artif. Intell."},{"key":"34_CR9","unstructured":"Madani, O., Raghavan, H., Jones, R.: On the empirical complexity of text classification problems. SRI AI Center Technical Report (2009)"},{"key":"34_CR10","unstructured":"Messelis, T., Haspeslagh, S., Bilgin, B., De Causmaecker, P., Vanden, G.: Towards prediction of algorithm performance in real world optimization problems. In: Proceedings of the 21st Benelux Conference on Artificial Intelligence, pp. 177\u2013183. BNAIC, Eindhoven (2009)"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: Methods and evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"key":"34_CR12","unstructured":"McKay, R., Abbass, H.: Anti-correlation measures in genetic programming. In: Proceedings of the Australasia-Japan Workshop on Intelligent and Evolutionary Systems, pp. 45\u201351 (2001)"},{"key":"34_CR13","unstructured":"Burke, R., Gustafson, S., Kendall, G.: A survey and analysis of diversity measures in genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 716\u2013723 (2002)"},{"key":"34_CR14","unstructured":"Thierens, D.: Predictive measures for problem representation and genetic operator design. Technical Report UU-CS-2002-055, Utrecht University: Information and Computing Sciences (2002)"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hamadi, Y., Hoos, H.H., Leyton-Brown, K.: Performance prediction and automated tuning of randomized and parametric algorithms. In: Principles and Practice of Constraint Programming-CP, pp. 213\u2013228 (2006)","DOI":"10.1007\/11889205_17"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Halim, S., Yap, R., Lau, H.: An integrated white\u00a0+\u00a0black box approach for designing and tuning stochastic local search. In: Principles and Practice of Constraint Programming\u2013CP, pp. 332\u2013347 (2007)","DOI":"10.1007\/978-3-540-74970-7_25"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Birattari, M.: Tuning Metaheuristics: A machine learning perspective. SCI 197. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-00483-4_7"},{"issue":"2","key":"34_CR18","first-page":"143","volume":"24","author":"H Akbaripour","year":"2013","unstructured":"Akbaripour, H., Masehian, E.: Efficient and robust parameter tuning for heuristic algorithms. Int. J. Ind. Eng. 24(2), 143\u2013150 (2013)","journal-title":"Int. J. Ind. Eng."},{"key":"34_CR19","unstructured":"Wright, S.: The roles of mutation, inbreeding, crossbreeding and selection in evolution. In: Proceedings of the Sixth International Genetics, vol. 1, pp. 356\u2013366 (1932)"},{"key":"34_CR20","unstructured":"Jones, T.: Evolutionary algorithms, fitness landscapes and search. Ph.D. thesis, The University of New Mexico (1995)"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Corne, D., Oates, M., Kell, D.: Landscape state machines: tools for evolutionary algorithm performance analyses and landscape\/algorithm mapping. In: Applications of Evolutionary Computing, pp. 187\u2013198 (2003)","DOI":"10.1007\/3-540-36605-9_18"},{"key":"34_CR22","doi-asserted-by":"crossref","unstructured":"Mitchell, B., Mancoridis, S.: Modeling the search landscape of metaheuristic software clustering algorithms. Lecture notes in computer science. In: Proceedings of the 2003 International Conference on Genetic and Evolutionary Computation, vol. 2, pp. 2499\u20132510 (2003)","DOI":"10.1007\/3-540-45110-2_153"},{"issue":"3","key":"34_CR23","first-page":"303","volume":"12","author":"P Merz","year":"2004","unstructured":"Merz, P.: Advanced fitness landscape analysis and the performance of memetic algorithms. Evol. Comput. Spec. Issue Magn. Algorithms 12(3), 303\u2013325 (2004)","journal-title":"Evol. Comput. Spec. Issue Magn. Algorithms"},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Qu, R., Burke, E.: Analyzing the landscape of a graph based hyper-heuristic for timetabling problems. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 341\u2013348 (2009)","DOI":"10.1145\/1569901.1569949"},{"key":"34_CR25","doi-asserted-by":"crossref","unstructured":"Czogalla, J., Fink, A.: Fitness landscape analysis for the resource constrained project scheduling problem. In: Lecture Notes in Computer Science, Learning and Intelligent Optimization, vol. 5851, pp. 104\u2013118 (2009)","DOI":"10.1007\/978-3-642-11169-3_8"},{"key":"34_CR26","doi-asserted-by":"crossref","unstructured":"Verel, S., Liefooghe, A., Jourdan, L., Dhaenens, C.: On the structure of multiobjective combinatorial search space: MNK-landscapes with correlated objectives. Eur. J. Oper. Res. (2012)","DOI":"10.1016\/j.ejor.2012.12.019"},{"issue":"1","key":"34_CR27","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1162\/106365600568103","volume":"8","author":"P Merz","year":"2000","unstructured":"Merz, P., Freisleben, B.: Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning. Evol. Comput. 8(1), 61\u201391 (2000)","journal-title":"Evol. Comput."},{"issue":"4","key":"34_CR28","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P Merz","year":"2000","unstructured":"Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. Evol. Comput. 4(4), 337\u2013352 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"34_CR29","doi-asserted-by":"crossref","unstructured":"Borenstein, Y.: Information landscapes. In: Genetic and Evolutionary Computation Conference, pp. 1515\u20131522 (2005)","DOI":"10.1145\/1068009.1068248"},{"key":"34_CR30","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/rsa.10004","volume":"19","author":"C Borgs","year":"2001","unstructured":"Borgs, C., Chayes, J., Pittel, B.: Phase transition and finite-size scaling for the integer partitioning problem. Random Struct. Algorithms 19, 247\u2013288 (2001)","journal-title":"Random Struct. Algorithms"},{"key":"34_CR31","unstructured":"B\u00e9jar, R., Vetsikas, I., Gomes, C., Kautz, H., Selman, B.: Structure and phase transition phenomena in the VTC problem. In TASK PI Meeting Workshop (2001)"},{"key":"34_CR32","unstructured":"Caramanis, C.: Survey propagation iterative solutions to constraint satisfaction problems. In: Expository Writing (2003)"},{"issue":"7043","key":"34_CR33","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1038\/nature03602","volume":"435","author":"D Achlioptas","year":"2005","unstructured":"Achlioptas, D., Naor, A., Peres, Y.: Rigorous location of phase transitions in hard optimization problems. Nature 435(7043), 759\u2013764 (2005)","journal-title":"Nature"},{"issue":"2","key":"34_CR34","first-page":"125","volume":"125","author":"S Mertens","year":"2006","unstructured":"Mertens, S.: The easiest hard problem: Number partitioning. Comput. Complex. Stat. Phys. 125(2), 125\u2013140 (2006)","journal-title":"Comput. Complex. Stat. Phys."},{"key":"34_CR35","unstructured":"Pi\u00f1ol, C.: CSP Problems as algorithmic benchmarks: Measures, methods and models. In: Universitat de Lleida, Departament d\u2019Inform\u00e0tica i Enginyeria Industrial (2008)"},{"key":"34_CR36","doi-asserted-by":"crossref","unstructured":"Rangel-Valdez, N., Torres-Jimenez, J.: Phase transition in the bandwidth minimization problem. In: Lecture Notes in Computer Science 5845, MICAI 2009: Advances in Artificial Intelligence, pp. 372\u2013383 (2009)","DOI":"10.1007\/978-3-642-05258-3_33"},{"issue":"4","key":"34_CR37","doi-asserted-by":"publisher","first-page":"041128","DOI":"10.1103\/PhysRevE.86.041128","volume":"86","author":"T Dewenter","year":"2012","unstructured":"Dewenter, T., Hartmann, A.: Phase transition for cutting-plane approach to vertex-cover problem. Phys. Rev. E 86(4), 041128 (2012)","journal-title":"Phys. Rev. E"},{"key":"34_CR38","unstructured":"Slaney, J., Walsh, T.: Backbones in optimization and approximation. In: Proceedings the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), pp. 254\u2013259 (2001)"},{"issue":"6740","key":"34_CR39","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1038\/22055","volume":"400","author":"R Monasson","year":"1999","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic \u2018phase transitions\u2019. Nature 400(6740), 133\u2013137 (1999)","journal-title":"Nature"},{"key":"34_CR40","doi-asserted-by":"crossref","unstructured":"Zeng, G., Lu, Y.: Survey on computational complexity with phase transitions and extremal optimization. In: Proceedings of 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference Shanghai, People\u2019s Republic of China, 16\u201318 Dec 2009","DOI":"10.1109\/CDC.2009.5400085"},{"key":"34_CR41","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1613\/jair.711","volume":"12","author":"J Singer","year":"2000","unstructured":"Singer, J., Gent, I.P., Smaill, A.: Backbone fragility and the local search cost peak. J. Artif. Intell. Res. (JAIR) 12, 235\u2013270 (2000)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"34_CR42","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0004-3702(02)00363-6","volume":"143","author":"J Watson","year":"2003","unstructured":"Watson, J., Beck, J., Howe, A., Whitley, L.: Problem difficulty for tabu search in job-shop scheduling. Artif. Intell. 143, 189\u2013217 (2003)","journal-title":"Artif. Intell."},{"issue":"1","key":"34_CR43","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0167-739X(02)00106-1","volume":"19","author":"J Schneider","year":"2003","unstructured":"Schneider, J.: Searching for backbones\u2014a high-performance parallel algorithm for solving combinatorial optimization problems. Future Gener. Comput. Syst. 19(1), 121\u2013131 (2003)","journal-title":"Future Gener. Comput. Syst."},{"issue":"1","key":"34_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2004.04.001","volume":"158","author":"W Zhang","year":"2004","unstructured":"Zhang, W.: Configuration landscape analysis and backbone guided local search: Part I: Satisfiability and maximum satisfiability. Artif. Intell. 158(1), 1\u201326 (2004)","journal-title":"Artif. Intell."},{"key":"34_CR45","unstructured":"Zhang, W., Looks, M.: A novel local search algorithm for the travelling salesman problem that exploits backbones. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp. 343\u2013350 (2005)"},{"issue":"12","key":"34_CR46","first-page":"8355","volume":"8","author":"G Zeng","year":"2012","unstructured":"Zeng, G., Lu, Y., Dai, Y., Wu, Z., Mao, W., Zhang, Z., Zheng, C.: Backbone guided extremal optimization for the hard maximum satisfiability problem. Int. J. Innovative Comput. Inf. Control 8(12), 8355\u20138366 (2012)","journal-title":"Int. J. Innovative Comput. Inf. Control"},{"key":"34_CR47","doi-asserted-by":"crossref","unstructured":"Quiroz, M., Cruz-Reyes, L., Torres-Jim\u00e9nez, J., Melin, P.: Improving the performance of heuristic algorithms based on exploratory data analysis. In: Recent Advances on Hybrid Intelligent Systems, pp. 361\u2013375 (2013)","DOI":"10.1007\/978-3-642-33021-6_29"},{"key":"34_CR48","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2, 5\u201330 (1996)","journal-title":"J. Heuristics"},{"key":"34_CR49","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/B:HEUR.0000026267.44673.ed","volume":"10","author":"A Alvim","year":"2004","unstructured":"Alvim, A., Glover, F., Ribeiro, C., Aloise, D.: A hybrid improvement heuristic for the one-dimensional bin packing problem. J. Heuristics 10, 205\u2013229 (2004)","journal-title":"J. Heuristics"},{"issue":"2","key":"34_CR50","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ejor.2010.11.004","volume":"210","author":"K Fleszar","year":"2011","unstructured":"Fleszar, K., Charalambous, C.: Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem. Eur. J. Oper. Res. 210(2), 176\u2013184 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"34_CR51","unstructured":"Cruz-Reyes, L., Quiroz, M., Alvim, A., Fraire H., G\u00f3mez, C., Torres-Jim\u00e9nez, J.: Heur\u00edsticas de agrupaci\u00f3n h\u00edbridas eficientes para el problema. Computaci\u00f3n y Sistemas 16(3) (2012)"},{"issue":"11","key":"34_CR52","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J. Beasley","year":"1990","unstructured":"Beasley, J.: OR-library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990). http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/binpackinfo.html","journal-title":"J. Oper. Res. Soc."},{"key":"34_CR53","unstructured":"Scholl, A., Klein, R.: Bin packing benchmark data sets (2014). http:\/\/www.wiwi.uni-jena.de\/Entscheidung\/binpp\/. Accessed 24 Feb 2014"},{"key":"34_CR54","unstructured":"ESICUP.: Euro especial interest group on cutting and packing, one dimensional cutting and packing data sets (2014). http:\/\/paginas.fe.up.pt\/~esicup\/tiki-list_file_gallery.php?galleryId=1. Accessed 24 Feb 2014"},{"key":"34_CR55","unstructured":"CaPaD.: Cutting and packing at dresden university, benchmark data sets (2014). http:\/\/www.math.tu-dresden.de\/~capad\/cpd-ti.html#pmp. Accessed 24 Feb 2014"},{"issue":"7","key":"34_CR56","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","volume":"24","author":"A Scholl","year":"1997","unstructured":"Scholl, A., Klein, R., J\u00fcrgens, C.: Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Comput. Oper. Res. 24(7), 627\u2013645 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"34_CR57","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01539705","volume":"18","author":"G W\u00e4scher","year":"1996","unstructured":"W\u00e4scher, G., Gau, T.: Heuristics for the one-dimensional cutting stock problem: A computational study. OR Spektrum 18(3), 131\u2013144 (1996)","journal-title":"OR Spektrum"},{"issue":"5\u20136","key":"34_CR58","first-page":"337","volume":"4","author":"P Schwerin","year":"1997","unstructured":"Schwerin, P., W\u00e4scher, G.: The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP. Int. Trans. Oper. Res. 4(5\u20136), 337\u2013389 (1997)","journal-title":"Int. Trans. Oper. Res."},{"key":"34_CR59","unstructured":"Schoenfield, J.E.: Fast exact solution of open bin packing problems without linear programming. In: Draft, US Army Space and Missile Defense Command, Huntsville, Alabama, USA (2002)"},{"key":"34_CR60","doi-asserted-by":"crossref","unstructured":"P\u00e9rez, J., Pazos, R.A., Frausto, J., Rodr\u00edguez, G., Romero, D., Cruz, L.: A statistical approach for algorithm selection. In: Ribeiro C.C., Matins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 417\u2013431 (2004)","DOI":"10.1007\/978-3-540-24838-5_31"},{"key":"34_CR61","doi-asserted-by":"crossref","unstructured":"Cruz-Reyes, L., G\u00f3mez-Santill\u00e1n, C., Schaeffer, S.E., Quiroz-Castellanos, M., Alvarez-Hern\u00e1ndez, V.M., P\u00e9rez-Rosas, V.: Enhancing accuracy of hybrid packing systems through general-purpose characterization. In: Hybrid Artificial Intelligent Systems, pp. 26\u201333 (2011)","DOI":"10.1007\/978-3-642-21222-2_4"},{"issue":"7","key":"34_CR62","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1016\/j.cor.2006.10.021","volume":"35","author":"K Loh","year":"2008","unstructured":"Loh, K., Golden, B., Wasil, E.: Solving the one-dimensional bin packing problem with a weight annealing heuristic. Comput. Oper. Res. 35(7), 2283\u20132291 (2008)","journal-title":"Comput. Oper. Res."},{"key":"34_CR63","volume-title":"Knapsack problems: Algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack problems: Algorithms and computer implementations. Wiley, New York (1990)"},{"issue":"3","key":"34_CR64","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Fast algorithms for bin packing. J. Comput. Syst. Sci. 8(3), 272\u2013314 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"34_CR65","unstructured":"Chiarandini, M., Paquete, L., Preuss, M., Ridge, E.: Experiments on metaheuristics: Methodological overview and open issues. In: Technical Report DMF-2007-03-003, The Danish Mathematical Society (2007)"}],"container-title":["Studies in Computational Intelligence","Recent Advances on Hybrid Approaches for Designing Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05170-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T22:26:41Z","timestamp":1675808801000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-05170-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319051697","9783319051703"],"references-count":65,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05170-3_34","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"27 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}