{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:54:19Z","timestamp":1725584059970},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212215"},{"type":"electronic","value":"9783642212222"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21222-2_4","type":"book-chapter","created":{"date-parts":[[2011,5,25]],"date-time":"2011-05-25T07:00:34Z","timestamp":1306306834000},"page":"26-33","source":"Crossref","is-referenced-by-count":1,"title":["Enhancing Accuracy of Hybrid Packing Systems through General-Purpose Characterization"],"prefix":"10.1007","author":[{"given":"Laura","family":"Cruz-Reyes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia","family":"G\u00f3mez-Santill\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satu Elisa","family":"Schaeffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcela","family":"Quiroz-Castellanos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor M.","family":"Alvarez-Hern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ver\u00f3nica","family":"P\u00e9rez-Rosas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C. Papadimitriou","year":"1998","unstructured":"Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Mineola. Dover Publications, New York (1998)"},{"key":"4_CR2","volume-title":"Modern heuristic techniques for combinatorial problems","author":"C.R. Reeves","year":"1993","unstructured":"Reeves, C.R.: Modern heuristic techniques for combinatorial problems. John Wiley & Sons, New York (1993)"},{"key":"4_CR3","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, vol.\u00a03 (2009)","DOI":"10.1007\/978-3-642-11169-3_7"},{"key":"4_CR4","unstructured":"Messelis, T., Haspeslagh, S., Bilgin, B., De Causmaecker, P., Vanden Berghe, G.: Towards prediction of algorithm performance in real world optimisation problems. In: Proceedings of the 21st Benelux Conference on Artificial Intelligence, BNAIC, Eindhoven pp. 177\u2013183 (2009)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-540-24838-5_31","volume-title":"Experimental and Efficient Algorithms","author":"J. P\u00e9rez","year":"2004","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., Martins, S.L. (eds.) WEA 2004. LNCS, vol.\u00a03059, pp. 417\u2013431. Springer, Heidelberg (2004)"},{"key":"4_CR6","unstructured":"Borghetti, B.J.: Inference algorithm Performance and Selection under Constrained Resources. M.Sc. Thesis. Faculty of the School of Engineering Air University Force Institute of Technology Air University (1996)"},{"key":"4_CR7","unstructured":"Yuan, B.: Towards Improved Experimental Evaluation and Comparison of Evolutionary Algorithms. Ph.D. Thesis, School of Information Technology and Electrical Engineering of The University of Queensland, Australia (2006)"},{"key":"4_CR8","first-page":"295","volume-title":"AI & MATH 2006, Special Issue of the Annals of Mathematics and Artificial Intelligence","author":"M. Gagliolo","year":"2007","unstructured":"Gagliolo, M., Schmidhuber, J.: Learning Dynamic Algorithm Portfolios. In: AI & MATH 2006, Special Issue of the Annals of Mathematics and Artificial Intelligence, vol.\u00a047, pp. 295\u2013328. Springer, Heidelberg (2007)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/3-540-46135-3_37","volume-title":"Principles and Practice of Constraint Programming - CP 2002","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. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 556\u2013572. Springer, Heidelberg (2002)"},{"key":"4_CR10","first-page":"95","volume":"44","author":"E.G. Coffman","year":"2002","unstructured":"Coffman, E.G., Courboubetis, C., Garey, M.R., Johnson, D.S., Shor, P.W., Weber, R.R.: Perfect Packing Theorems and the Average Case Behavior of Optimal and Online Bin Packing. ACM-SIAM Review. Society for Industrial and Applied Mathematics\u00a044, 95\u2013108 (2002)","journal-title":"ACM-SIAM Review. Society for Industrial and Applied Mathematics"},{"key":"4_CR11","first-page":"46","volume-title":"Approximation Algorithms for NP-hard Problems","author":"J. Coffman","year":"1997","unstructured":"Coffman, J., Garey, M., Jonson, D.: Approximation Algorithms for Bin-Packing, a Survey. In: Approximation Algorithms for NP-hard Problems, pp. 46\u201393. PWS, Boston (1997)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-1-4757-3023-4_3","volume-title":"Handbook of Combinatorial Optimization","author":"J.E. Coffman","year":"1999","unstructured":"Coffman, J.E., Galambos, G., Martello, S., Vigo, D.: Bin Packing Approximation Algorithms: Combinatorial Analysis. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 151\u2013207. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"4_CR13","series-title":"LNCS","first-page":"119","volume-title":"MICAI 2004","author":"J. P\u00e9rez","year":"2002","unstructured":"P\u00e9rez, J., Pazos, R.A., V\u00e9lez, L., Rodr\u00edguez, G.: Automatic Generation of Control Parameters for the Threshold Accepting Algorithm. In: Coello, C.A., Albornoz, A., Sucar, L.E., Cair\u00f3, O.B. (eds.) LNCS, vol.\u00a04128, pp. 119\u2013127. Springer, Heidelberg (2002)"},{"key":"4_CR14","unstructured":"Ducatelle, F., Levine, J.: Ant Colony Optimisation for Bin Packing and Cutting Stock Problems. In: Proceedings of the UK Workshop on Computational Intelligence, Edinburgh (2001)"},{"key":"4_CR15","volume-title":"Simulaci\u00f3n. Segunda edici\u00f3n","author":"S.M. Ross","year":"1999","unstructured":"Ross, S.M.: Simulaci\u00f3n. Segunda edici\u00f3n. Prentice Hall, EEUU (1999)"},{"key":"4_CR16","doi-asserted-by":"publisher","DOI":"10.1201\/9781420035223","volume-title":"CRC Concise Encyclopedia of Mathematics","author":"E.W. Weisstein","year":"2002","unstructured":"Weisstein, E.W.: CRC Concise Encyclopedia of Mathematics, 2nd edn. CRC Press, FL (2002)","edition":"2"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1016\/j.patcog.2004.03.009","volume":"37","author":"M.R. Boutell","year":"2004","unstructured":"Boutell, M.R., Luo, J., Shen, X., Brown, C.M.: Learning Multi-label Scene Classification. Pattern Recognition\u00a037, 1757\u20131771 (2004)","journal-title":"Pattern Recognition"},{"key":"4_CR18","first-page":"307","volume-title":"Proceedings of IIS 2006 Symposium, Intelligent Information Processing and Web Mining, Advances in Soft Computing","author":"A. Wieczorkowska","year":"2006","unstructured":"Wieczorkowska, A., Synak, P., Ras, Z.: Multi-label classification of emotions in music. In: Proceedings of IIS 2006 Symposium, Intelligent Information Processing and Web Mining, Advances in Soft Computing, pp. 307\u2013315. Springer, Heidelberg (2006)"},{"key":"4_CR19","unstructured":"Alsabti, K., Ranka, S., Singh, V.: An Efficient K-Means Clustering Algorithm. In: IPPS\/SPDP Workshop on High Performance Data Mining, Orlando, Florida (1998)"},{"key":"4_CR20","unstructured":"Beasley, J.E.: Bin Packing - one dimensional. Brunel University. The Beasley\u2019s OR-Library, \n                    \n                      http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/binpackinfo.html"},{"key":"4_CR21","unstructured":"Scholl, A., Klein, R.: Bin Packing, Jena Univerity, \n                    \n                      http:\/\/www.wiwi.uni-jena.de\/Entscheidung\/binpp\/metric.htm"},{"key":"4_CR22","unstructured":"Quinlan, J.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo; Book Review, vol.\u00a016(3), pp. 235\u2013240. Springer, Heidelberg (1993)"},{"key":"4_CR23","unstructured":"Dallas, J.: M\u00e9todos Multivariados Aplicados al An\u00e1lisis de Datos. In: Thomson (ed.) Internacional, M\u00e9xico (2000)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21222-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T09:56:36Z","timestamp":1558605396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21222-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212215","9783642212222"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21222-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}