{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:42:31Z","timestamp":1725856951646},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319388502"},{"type":"electronic","value":"9783319388519"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-38851-9_4","type":"book-chapter","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T11:33:54Z","timestamp":1464694434000},"page":"50-62","source":"Crossref","is-referenced-by-count":0,"title":["UKP5: A New Algorithm for the Unbounded Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Henrique","family":"Becker","sequence":"first","affiliation":[]},{"given":"Luciana S.","family":"Buriol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,1]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(99)00265-9","volume":"123","author":"R Andonov","year":"2000","unstructured":"Andonov, R., Poirriez, V., Rajopadhye, S.: Unbounded knapsack problem: dynamic programming revisited. Eur. J. Oper. Res. 123(2), 394\u2013407 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"4_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.ejor.2004.08.036","volume":"171","author":"G Belov","year":"2006","unstructured":"Belov, G., Scheithauer, G.: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Eur. J. Oper. Res. 171(1), 85\u2013106 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR3","unstructured":"Delorme, M., Iori, M., Martello, S.: Bin packing and cutting stock problems: mathematical models and exact algorithms. In: Decision Models for Smarter Cities (2014)"},{"key":"4_CR4","volume-title":"Integer Programming","author":"RS Garfinkel","year":"1972","unstructured":"Garfinkel, R.S., Nemhauser, G.L.: Integer Programming, vol. 4. Wiley, New York (1972)"},{"issue":"6","key":"4_CR5","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting-stock problem. Oper. Res. 9(6), 849\u2013859 (1961)","journal-title":"Oper. Res."},{"issue":"6","key":"4_CR6","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"PC Gilmore","year":"1963","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem-Part II. Oper. Res. 11(6), 863\u2013888 (1963)","journal-title":"Oper. Res."},{"key":"4_CR7","unstructured":"Hu, T.C.: Integer programming and network flows. Technical report, DTIC Document (1969)"},{"issue":"5","key":"4_CR8","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.orl.2012.05.001","volume":"40","author":"PH Huang","year":"2012","unstructured":"Huang, P.H., Tang, K.: A constructive periodicity bound for the unbounded knapsack problem. Oper. Res. Lett. 40(5), 329\u2013331 (2012)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"4_CR9","doi-asserted-by":"crossref","first-page":"16","DOI":"10.2174\/1874114200802010016","volume":"2","author":"H Iida","year":"2008","unstructured":"Iida, H.: Two topics in dominance relations for the unbounded knapsack problem. Open Appl. Math. J. 2(1), 16\u201319 (2008)","journal-title":"Open Appl. Math. J."},{"issue":"1","key":"4_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0167-6377(90)90035-4","volume":"9","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: An exact algorithm for large unbounded knapsack problems. Oper. Res. Lett. 9(1), 15\u201320 (1990)","journal-title":"Oper. Res. Lett."},{"key":"4_CR11","unstructured":"Pisinger, D.: Algorithms for knapsack problems (1995)"},{"issue":"1","key":"4_CR12","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.disopt.2008.09.004","volume":"6","author":"V Poirriez","year":"2009","unstructured":"Poirriez, V., Yanev, N., Andonov, R.: A hybrid algorithm for the unbounded knapsack problem. Discrete Optim. 6(1), 110\u2013124 (2009)","journal-title":"Discrete Optim."}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38851-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T11:24:55Z","timestamp":1498303495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38851-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388502","9783319388519"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38851-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}