{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T12:41:40Z","timestamp":1781613700817,"version":"3.54.5"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,4,7]],"date-time":"2017-04-07T00:00:00Z","timestamp":1491523200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,4,7]],"date-time":"2017-04-07T00:00:00Z","timestamp":1491523200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DE160100850"],"award-info":[{"award-number":["DE160100850"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["Emmy Noether grant HU 1900\/2-1"],"award-info":[{"award-number":["Emmy Noether grant HU 1900\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10732-017-9328-y","type":"journal-article","created":{"date-parts":[[2017,4,7]],"date-time":"2017-04-07T04:04:37Z","timestamp":1491537877000},"page":"295-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":51,"title":["A case study of algorithm selection for the traveling thief problem"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3124-0061","authenticated-orcid":false,"given":"Markus","family":"Wagner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marius","family":"Lindauer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mustafa","family":"M\u0131s\u0131r","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samadhi","family":"Nallaperuma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Hutter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,4,7]]},"reference":[{"issue":"1","key":"9328_CR1","first-page":"82","volume":"15","author":"D Applegate","year":"2003","unstructured":"Applegate, D., Cook, W.J., Rohe, A.: Chained Lin\u2013Kernighan for large traveling salesman problems. J. Comput. 15(1), 82\u201392 (2003)","journal-title":"J. Comput."},{"issue":"11","key":"9328_CR2","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"EJ Beasley","year":"1990","unstructured":"Beasley, E.J.: Or-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"9328_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.aei.2004.07.001","volume":"18","author":"JE Bell","year":"2004","unstructured":"Bell, J.E., McMullen, P.R.: Ant colony optimization techniques for the vehicle routing problem. Adv. Eng. Inform. 18(1), 41\u201348 (2004)","journal-title":"Adv. Eng. Inform."},{"key":"9328_CR4","volume-title":"Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications","year":"2009","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)"},{"key":"9328_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.artint.2016.04.003","volume":"237","author":"B Bischl","year":"2016","unstructured":"Bischl, B., Kerschke, P., Kotthoff, L., Lindauer, M., Malitsky, Y., Frech\u00e9tte, A., Hoos, H., Hutter, F., Leyton-Brown, K., Tierney, K., Vanschoren, J.: ASlib: a benchmark library for algorithm selection. Artif. Intell. 237, 41\u201358 (2016)","journal-title":"Artif. Intell."},{"key":"9328_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54157-0_4","volume-title":"Solving the Bi-objective Traveling Thief Problem with Multi-objective Evolutionary Algorithms","author":"J Blank","year":"2017","unstructured":"Blank, J., Deb, K., Mostaghim, S.: Solving the Bi-objective Traveling Thief Problem with Multi-objective Evolutionary Algorithms. Springer, Berlin (2017)"},{"key":"9328_CR7","doi-asserted-by":"crossref","unstructured":"Bonyadi, M.R., Michalewicz, Z., Barone, L.: The travelling thief problem: the first step in the transition from theoretical problems to realistic problems. In: Congress on Evolutionary Computation, pp. 1037\u20131044. IEEE, (2013)","DOI":"10.1109\/CEC.2013.6557681"},{"key":"9328_CR8","doi-asserted-by":"crossref","unstructured":"Bonyadi, M.R., Michalewicz, Z., Przybylek, M.R., Wierzbicki, A.: Socially inspired algorithms for the TTP. In: Genetic and Evolutionary Computation Conference, pp. 421\u2013428. ACM, (2014)","DOI":"10.1145\/2576768.2598367"},{"key":"9328_CR9","unstructured":"Bonyadi, M.R., Michalewicz, Z., Neumann, F., Wagner, M.: Evolutionary computation for multicomponent problems: opportunities and future directions. CoRR abs\/1606.06818. http:\/\/arxiv.org\/abs\/1606.06818 (2016)"},{"key":"9328_CR10","volume-title":"Metalearning: Applications to Data Mining","author":"P Brazdil","year":"2008","unstructured":"Brazdil, P., Giraud-Carrier, C., Soares, C., Vilalta, R.: Metalearning: Applications to Data Mining, 1st edn. Springer, Berlin (2008)","edition":"1"},{"key":"9328_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breimann","year":"2001","unstructured":"Breimann, L.: Random forests. Mach. Learn. J. 45, 5\u201332 (2001)","journal-title":"Mach. Learn. J."},{"key":"9328_CR12","volume-title":"Computational Aspects of Cooperative Game Theory, Synthesis Lectures on Artificial Intelligence and Machine Learning","author":"G Chalkiadakis","year":"2011","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational Aspects of Cooperative Game Theory, Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, San Rafael (2011)"},{"key":"9328_CR13","doi-asserted-by":"crossref","unstructured":"Chand, S., Wagner, M.: Fast heuristics for the multiple traveling thieves problem. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 293\u2013300. ACM, (2016)","DOI":"10.1145\/2908812.2908841"},{"issue":"1","key":"9328_CR14","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manag. Sci."},{"key":"9328_CR15","doi-asserted-by":"crossref","unstructured":"El\u00a0Yafrani, M., Ahiod, B.: Population-based versus single-solution heuristics for the travelling thief problem. In: Genetic and Evolutionary Computation Conference (GECCO), pp. 317\u2013324 . ACM, (2016)","DOI":"10.1145\/2908812.2908847"},{"key":"9328_CR16","doi-asserted-by":"crossref","unstructured":"Faulkner, H., Polyakovskiy, S., Schultz, T., Wagner, M.: Approximate approaches to the traveling thief problem. In: Genetic and Evolutionary Computation Conference, pp. 385\u2013392. ACM, (2015)","DOI":"10.1145\/2739480.2754716"},{"key":"9328_CR17","doi-asserted-by":"crossref","unstructured":"Frechette, A., Kotthoff, L., Rahwan, T., Hoos, H., Leyton-Brown, K., Michalak, T.: Using the shapley value to analyze algorithm portfolios. In: 30th AAAI Conference on Artificial Intelligence (2016)","DOI":"10.1609\/aaai.v30i1.10440"},{"key":"9328_CR18","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1017\/S1471068414000210","volume":"14","author":"H Hoos","year":"2014","unstructured":"Hoos, H., Lindauer, M., Schaub, T.: Claspfolio 2: advances in algorithm selection for answer set programming. Theory Pract. Logic Program. 14, 569\u2013585 (2014)","journal-title":"Theory Pract. Logic Program."},{"key":"9328_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1017\/S1471068414000015","volume":"15","author":"H Hoos","year":"2015","unstructured":"Hoos, H., Kaminski, R., Lindauer, M., Schaub, T.: Aspeed: solver scheduling via answer set programming. Theory Pract. Logic Program. 15, 117\u2013142 (2015)","journal-title":"Theory Pract. Logic Program."},{"key":"9328_CR20","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"275","author":"B Huberman","year":"1997","unstructured":"Huberman, B., Lukose, R., Hogg, T.: An economic approach to hard computational problems. Science 275, 51\u201354 (1997)","journal-title":"Science"},{"key":"9328_CR21","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36, 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"9328_CR22","unstructured":"Hutter, F., Hoos, H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello C (ed.) Proceedings of the Fifth International Conference on Learning and Intelligent Optimization (LION\u201911). Lecture Notes in Computer Science, vol. 6683, pp. 507\u2013523. Springer, (2011)"},{"key":"9328_CR23","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., Leyton-Brown, K.: Algorithm runtime prediction: methods and evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"key":"9328_CR24","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC\u2014instance-specific algorithm configuration. In: Coelho H, Studer R, Wooldridge M (eds.) Proceedings of the Nineteenth European Conference on Artificial Intelligence (ECAI\u201910), pp. 751\u2013756. IOS Press, (2010)"},{"key":"9328_CR25","unstructured":"Kadioglu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm selection and scheduling. In: Lee J (ed.) Proceedings of the Seventeenth International Conference on Principles and Practice of Constraint Programming (CP\u201911). Lecture Notes in Computer Science, vol. 6876, pp. 454\u2013469. Springer, (2011)"},{"issue":"1\u20132","key":"9328_CR26","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/mcda.1598","volume":"24","author":"K Klamroth","year":"2017","unstructured":"Klamroth, K., Mostaghim, S., Naujoks, B., Poles, S., Purshouse, R., Rudolph, G., Ruzika, S., Sayn, S., Wiecek, M.M., Yao, X.: Multiobjective optimization for interwoven systems. J. Multi Criteria Decis. Anal. 24(1\u20132), 71\u201381 (2017)","journal-title":"J. Multi Criteria Decis. Anal."},{"issue":"2","key":"9328_CR27","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"key":"9328_CR28","doi-asserted-by":"crossref","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. In: Bessiere C, De Raedt L, Kotthoff L, Nijssen S, O\u2019Sullivan B, Pedreschi D (eds.) Data Mining and Constraint Programming, pp. 149\u2013190. Springer (2016)","DOI":"10.1007\/978-3-319-50137-6_7"},{"issue":"3","key":"9328_CR29","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3), 345\u2013358 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"9328_CR30","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y.: Learning the empirical hardness of optimization problems: the case of combinatorial auctions. In: Hentenryck PV (ed.) Principles and Practice of Constraint Programming\u2014CP 2002. Lecture Notes in Computer Science, vol. 2470, pp. 556\u2013572. Springer, (2002)"},{"key":"9328_CR31","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1613\/jair.4726","volume":"53","author":"M Lindauer","year":"2015","unstructured":"Lindauer, M., Hoos, H., Hutter, F., Schaub, T.: Autofolio: an automatically configured algorithm selector. J. Artif. Intell. 53, 745\u2013778 (2015)","journal-title":"J. Artif. Intell."},{"key":"9328_CR32","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm portfolios based on cost-sensitive hierarchical clustering. In: Rossi F (ed.) Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI\u201913), pp. 608\u2013614. (2013)"},{"key":"9328_CR33","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1017\/S1471068413000094","volume":"14","author":"M Maratea","year":"2014","unstructured":"Maratea, M., Pulina, L., Ricca, F.: A multi-engine approach to answer-set programming. Theory Pract. Logic Program. 14, 841\u2013868 (2014)","journal-title":"Theory Pract. Logic Program."},{"issue":"3","key":"9328_CR34","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Manag. Sci. 45(3), 414\u2013424 (1999)","journal-title":"Manag. Sci."},{"key":"9328_CR35","doi-asserted-by":"crossref","unstructured":"Mei, Y., Li, X., Yao, X.: Improving efficiency of heuristics for the large scale traveling thief problem. In: Simulated Evolution and Learning. LNCS, vol. 8886, pp. 631\u2013643 Springer (2014a)","DOI":"10.1007\/978-3-319-13563-2_53"},{"issue":"1","key":"9328_CR36","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00500-014-1487-2","volume":"20","author":"Y Mei","year":"2014","unstructured":"Mei, Y., Li, X., Yao, X.: On investigation of interdependence between sub-problems of the TTP. Soft Comput. 20(1), 157\u2013172 (2014b)","journal-title":"Soft Comput."},{"key":"9328_CR37","unstructured":"Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., Neumann, F.: Local search and the traveling salesman problem: A feature-based characterization of problem hardness. In: Hamadi Y, Schoenauer M (eds.) Learning and Intelligent Optimization: 6th International Conference (LION 6), pp. 115\u2013129. Springer, (2012)"},{"issue":"2","key":"9328_CR38","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10472-013-9341-2","volume":"69","author":"O Mersmann","year":"2013","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., Neumann, F.: A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. Ann. Math. Artif. Intell. 69(2), 151\u2013182 (2013)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"November","key":"9328_CR39","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/2390009.2399411","volume":"2012","author":"Z Michalewicz","year":"2012","unstructured":"Michalewicz, Z.: Ubiquity symposium: evolutionary computation and the processes of life: the emperor is naked: evolutionary algorithms for real-world applications. Ubiquity 2012(November), 3:1\u20133:13 (2012)","journal-title":"Ubiquity"},{"key":"9328_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07807-5","volume-title":"How to Solve It\u2014Modern Heuristics: Second, Revised and Extended","author":"Z Michalewicz","year":"2004","unstructured":"Michalewicz, Z., Fogel, D.B.: How to Solve It\u2014Modern Heuristics: Second, Revised and Extended, 2nd edn. Springer, Berlin (2004)","edition":"2"},{"key":"9328_CR41","unstructured":"M\u0131s\u0131r, M., Sebag, M.: Algorithm selection as a collaborative filtering problem. Technical report. INRIA-Saclay. http:\/\/hal.inria.fr\/hal-00922840 (2013)"},{"key":"9328_CR42","doi-asserted-by":"crossref","unstructured":"Nallaperuma, S., Wagner, M., Neumann, F.: Ant colony optimisation and the traveling salesperson problem: Hardness, features and parameter settings. In: Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation, ACM, New York, NY, USA, GECCO \u201913 Companion, pp. 13\u201314. (2013a)","DOI":"10.1145\/2464576.2464581"},{"key":"9328_CR43","doi-asserted-by":"crossref","unstructured":"Nallaperuma, S., Wagner, M., Neumann, F., Bischl, B., Mersmann, O., Trautmann, H.: A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem. In: Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII, ACM, New York, NY, USA, FOGA XII \u201913, pp. 147\u2013160. (2013b)","DOI":"10.1145\/2460239.2460253"},{"key":"9328_CR44","doi-asserted-by":"crossref","unstructured":"Nallaperuma, S., Wagner, M., Neumann, F.: Parameter prediction based on features of evolved instances for ant colony optimization and the traveling salesperson problem. In: Parallel Problem Solving from Nature PPSN XIII. LNCS, vol. 8672. pp. 100\u2013109. Springer, (2014)","DOI":"10.1007\/978-3-319-10762-2_10"},{"key":"9328_CR45","doi-asserted-by":"publisher","first-page":"18","DOI":"10.3389\/frobt.2015.00018","volume":"2","author":"S Nallaperuma","year":"2015","unstructured":"Nallaperuma, S., Wagner, M., Neumann, F.: Analyzing the effects of instance features and algorithm parameters for max min ant system and the traveling salesperson problem. Front. Robot. AI 2, 18 (2015)","journal-title":"Front. Robot. AI"},{"key":"9328_CR46","unstructured":"Polyakovskiy, S., Neumann, F.: Packing while traveling: Mixed integer programming for a class of nonlinear knapsack problems. In: Integration of AI and OR Techniques in Constraint Programming. LNCS, vol. 9075, pp. 330\u2013344. Springer, (2015)"},{"key":"9328_CR47","doi-asserted-by":"crossref","unstructured":"Polyakovskiy, S., Bonyadi, M.R., Wagner, M., Michalewicz, Z., Neumann, F.: A comprehensive benchmark set and heuristics for the traveling thief problem. In: Genetic and Evolutionary Computation Conference, pp. 477\u2013484. ACM, (2014a)","DOI":"10.1145\/2576768.2598249"},{"key":"9328_CR48","unstructured":"Polyakovskiy, S., Bonyadi, M.R., Wagner, M., Michalewicz, Z., Neumann, F.: TTP Test Data. http:\/\/cs.adelaide.edu.au\/~optlog\/research\/ttp.php (2014b)"},{"issue":"4","key":"9328_CR49","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"9328_CR50","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J Rice","year":"1976","unstructured":"Rice, J.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"issue":"2","key":"9328_CR51","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11721-007-0005-x","volume":"1","author":"AE Rizzoli","year":"2007","unstructured":"Rizzoli, A.E., Montemanni, R., Lucibello, E., Gambardella, L.M.: Ant colony optimization for real-world vehicle routing problems. Swarm Intell. 1(2), 135\u2013151 (2007)","journal-title":"Swarm Intell."},{"issue":"1","key":"9328_CR52","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/1456650.1456656","volume":"41","author":"K Smith-Miles","year":"2008","unstructured":"Smith-Miles, K.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41(1), 6 (2008)","journal-title":"ACM Comput. Surv."},{"key":"9328_CR53","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2013.11.015","volume":"45","author":"K Smith-Miles","year":"2014","unstructured":"Smith-Miles, K., Baatar, D., Wreford, B., Lewis, R.: Towards objective measures of algorithm performance across instance space. Comput. OR 45, 12\u201324 (2014)","journal-title":"Comput. OR"},{"key":"9328_CR54","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: MAX\u2013MIN ant system. J. Future Gener. Comput. Syst. 16, 889\u2013914 (2000)","journal-title":"J. Future Gener. Comput. Syst."},{"key":"9328_CR55","unstructured":"van Rijn, J., Abdulrahman, S., Brazdil, P., Vanschoren, J.: Fast algorithm selection using learning curves. In: Fromont \u00c9, Bie TD, van Leeuwen M (eds.) Proceedings of the international symposium on Advances in Intelligent Data Analysis (IDA). Lecture Notes in Computer Science, vol. 9385, pp. 298\u2013309. Springer, (2015)"},{"issue":"2","key":"9328_CR56","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1019956318069","volume":"18","author":"R Vilalta","year":"2002","unstructured":"Vilalta, R., Drissi, Y.: A perspective view and survey of meta-learning. Artif. Intell. Rev. 18(2), 77\u201395 (2002)","journal-title":"Artif. Intell. Rev."},{"key":"9328_CR57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44427-7_25","volume-title":"Stealing Items More Efficiently with Ants, A Swarm Intelligence Approach to the Travelling Thief Problem","author":"M Wagner","year":"2016","unstructured":"Wagner, M.: Stealing Items More Efficiently with Ants, A Swarm Intelligence Approach to the Travelling Thief Problem. Springer, Cham (2016)"},{"key":"9328_CR58","first-page":"1","volume-title":"Nature-Inspired Algorithms for Optimisation","author":"T Weise","year":"2009","unstructured":"Weise, T., Zapf, M., Chiong, R., Nebro, A.J.: Why is optimization difficult? In: Chiong, R. (ed.) Nature-Inspired Algorithms for Optimisation, pp. 1\u201350. Springer, Heidelberg (2009)"},{"key":"9328_CR59","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"9328_CR60","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Hydra-MIP: automated algorithm configuration and selection for mixed integer programming. In: RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion at the International Joint Conference on Artificial Intelligence (IJCAI). (2011)"},{"key":"9328_CR61","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Evaluating component solver contributions to portfolio-based algorithm selectors. In: Cimatti A, Sebastiani R (eds.) Proceedings of the Fifteenth International Conference on Theory and Applications of Satisfiability Testing (SAT\u201912). Lecture Notes in Computer Science, vol. 7317, pp. 228\u2013241. Springer, (2012)"},{"key":"9328_CR62","unstructured":"Yafrani, M.E., Chand, S., Neumann, A., Wagner, M.: A Case Study of Multi-objectiveness in Multi-component Problems. http:\/\/cs.adelaide.edu.au\/~optlog\/research\/combinatorial.php (2017)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-017-9328-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9328-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9328-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T01:31:10Z","timestamp":1692754270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-017-9328-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,7]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["9328"],"URL":"https:\/\/doi.org\/10.1007\/s10732-017-9328-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,7]]},"assertion":[{"value":"31 July 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}