{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:40:31Z","timestamp":1725882031678},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319554525"},{"type":"electronic","value":"9783319554532"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-55453-2_13","type":"book-chapter","created":{"date-parts":[[2017,3,8]],"date-time":"2017-03-08T10:12:42Z","timestamp":1488967962000},"page":"189-200","source":"Crossref","is-referenced-by-count":5,"title":["Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants"],"prefix":"10.1007","author":[{"given":"John H.","family":"Drake","sequence":"first","affiliation":[]},{"given":"Jerry","family":"Swan","sequence":"additional","affiliation":[]},{"given":"Geoff","family":"Neumann","sequence":"additional","affiliation":[]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,9]]},"reference":[{"key":"13_CR1","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, Hoboken (1990)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0029568","volume-title":"Online Algorithms","author":"J Csirik","year":"1998","unstructured":"Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms. LNCS, vol. 1442, pp. 147\u2013177. Springer, Heidelberg (1998). doi: 10.1007\/BFb0029568"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/978-1-4419-7997-1_35","volume-title":"Handbook of Combinatorial Optimization","author":"EG Coffman Jr","year":"2013","unstructured":"Coffman Jr., E.G., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Pardalos, P.M., Du, D.Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 455\u2013531. Springer, New York (2013)"},{"issue":"3","key":"13_CR4","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"CC Lee","year":"1985","unstructured":"Lee, C.C., Lee, D.T.: A simple on-line bin-packing algorithm. J. ACM 32(3), 562\u2013572 (1985)","journal-title":"J. ACM"},{"issue":"2","key":"13_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1057\/jors.1994.28","volume":"45","author":"Z Sinuany-Stern","year":"1994","unstructured":"Sinuany-Stern, Z., Weiner, I.: The one dimensional cutting stock problem using two objectives. J. Oper. Res. Soc. 45(2), 231\u2013236 (1994)","journal-title":"J. Oper. Res. Soc."},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/978-1-4419-1665-5_15","volume-title":"Handbook of Metaheuristics","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, vol. 146, pp. 449\u2013468. Springer, Heidelberg (2010)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Woodward, J.R., Swan, J.: The automatic generation of mutation operators for genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2012), pp. 67\u201374. ACM (2012)","DOI":"10.1145\/2330784.2330796"},{"issue":"9\/10","key":"13_CR8","doi-asserted-by":"crossref","first-page":"1500","DOI":"10.1108\/K-09-2013-0201","volume":"43","author":"JH Drake","year":"2014","unstructured":"Drake, J.H., Hyde, M., Ibrahim, K., Ozcan, E.: A genetic programming hyper-heuristic for the multidimensional knapsack problem. Kybernetes 43(9\/10), 1500\u20131511 (2014)","journal-title":"Kybernetes"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Woodward, J.: Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2007), pp. 1559\u20131565. ACM (2007)","DOI":"10.1145\/1276958.1277273"},{"issue":"1","key":"13_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1162\/EVCO_a_00044","volume":"20","author":"EK Burke","year":"2012","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Woodward, J.: Automating the packing heuristic design process with genetic programming. Evol. Comput. 20(1), 63\u201389 (2012)","journal-title":"Evol. Comput."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, E., Parkes, A.J.: Policy matrix evolution for generation of heuristics. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2011), pp. 2011\u20132018. ACM (2011)","DOI":"10.1145\/2001576.2001846"},{"issue":"4","key":"13_CR12","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3(4), 299\u2013325 (1974)","journal-title":"SIAM J. Comput."},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.eswa.2016.07.005","volume":"63","author":"S Asta","year":"2016","unstructured":"Asta, S., \u00d6zcan, E., Parkes, A.J.: CHAMP: creating heuristics via many parameters for online bin packing. Expert Syst. Appl. 63, 208\u2013221 (2016)","journal-title":"Expert Syst. Appl."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Yarimcam, A., Asta, S., \u00d6zcan, E., Parkes, A.J.: Heuristic generation via parameter tuning for online bin packing. In: IEEE Symposium on Evolving and Autonomous Learning Systems (EALS 2014), pp. 102\u2013108. IEEE (2014)","DOI":"10.1109\/EALS.2014.7009510"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1007\/11844297_87","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"EK Burke","year":"2006","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G.: Evolving bin packing heuristics with genetic programming. In: Runarsson, T.P., Beyer, H.-G., Burke, E., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 860\u2013869. Springer, Heidelberg (2006). doi: 10.1007\/11844297_87"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Woodward, J.R.: The scalability of evolved on line bin packing heuristics. In: 2007 IEEE Congress on Evolutionary Computation, pp. 2530\u20132537. IEEE (2007)","DOI":"10.1109\/CEC.2007.4424789"},{"key":"13_CR17","unstructured":"Ross, P., Schulenburg, S., Mar\u00edn-Bl\u00e1zquez, J.G., Hart, E.: Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), pp. 942\u2013948 (2002)"},{"key":"13_CR18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science (LNCS)","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-29139-5_14","volume-title":"Genetic Programming","author":"AJ Parkes","year":"2012","unstructured":"Parkes, A.J., \u00d6zcan, E., Hyde, M.R.: Matrix analysis of genetic programming mutation. In: Moraglio, A., Silva, S., Krawiec, K., Machado, P., Cotta, C. (eds.) EuroGP 2012. LNCS, vol. 7244, pp. 158\u2013169. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29139-5_14"},{"key":"13_CR20","volume-title":"Handbook of Mathematical Functions","author":"M Abramowitz","year":"1965","unstructured":"Abramowitz, M., Stegun, I.: Handbook of Mathematical Functions. Dover Publications, New York (1965)"},{"issue":"368","key":"13_CR21","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1080\/01621459.1979.10481038","volume":"74","author":"WS Cleveland","year":"1979","unstructured":"Cleveland, W.S.: Robust locally weighted regression and smoothing scatterplots. J. Am. Stat. Assoc. 74(368), 829\u2013836 (1979)","journal-title":"J. Am. Stat. Assoc."},{"key":"13_CR22","series-title":"Texts in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21738-3","volume-title":"Introduction to Numerical Analysis","author":"J Stoer","year":"2002","unstructured":"Stoer, J., Bulirsch, R.: Introduction to Numerical Analysis. Texts in Applied Mathematics. Springer, Heidelberg (2002)"},{"issue":"2","key":"13_CR23","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159\u2013195 (2001)","journal-title":"Evol. Comput."},{"key":"13_CR24","unstructured":"Rechenberg, I.: Evolutionsstrategie: optimierung technischer systeme nach prinzipien der biologischen evolution. Number 15 in Problemata. Frommann-Holzboog, Stuttgart-Bad Cannstatt (1973)"},{"issue":"1","key":"13_CR25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. (TOMACS) 8(1), 3\u201330 (1998)","journal-title":"ACM Trans. Model. Comput. Simul. (TOMACS)"},{"key":"13_CR26","volume-title":"Essentials of Metaheuristics","author":"S Luke","year":"2013","unstructured":"Luke, S.: Essentials of Metaheuristics, 2nd edn. Lulu, Raleigh (2013)","edition":"2"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Asta, S., \u00d6zcan, E.: A tensor analysis improved genetic algorithm for online bin packing. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 799\u2013806. ACM, New York (2015)","DOI":"10.1145\/2739480.2754787"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55453-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T12:10:30Z","timestamp":1498392630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55453-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319554525","9783319554532"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55453-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}