{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:59:28Z","timestamp":1725728368780},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385353"},{"type":"electronic","value":"9783642385360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_2","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T01:03:04Z","timestamp":1370221384000},"page":"12-23","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Knapsack Solver for Column Generation"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Kraft","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Bellman, R.E.: Dynamic Programming. Princeton University Press (1957)"},{"key":"2_CR2","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979)"},{"issue":"6","key":"2_CR3","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P. Gilmore","year":"1961","unstructured":"Gilmore, P., Gomory, R.: A linear programming approach to the cutting stock problem. Operations Research\u00a09(6), 849\u2013859 (1961)","journal-title":"Operations Research"},{"issue":"6","key":"2_CR4","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P. Gilmore","year":"1963","unstructured":"Gilmore, P., Gomory, R.: A linear programming approach to the cutting stock problem\u2014Part II. Operations Research\u00a011(6), 863\u2013888 (1963)","journal-title":"Operations Research"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O.H. Ibarra","year":"1975","unstructured":"Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM\u00a022, 463\u2013468 (1975)","journal-title":"Journal of the ACM"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-642-32589-2_47","volume-title":"Mathematical Foundations of Computer Science 2012","author":"K. Jansen","year":"2012","unstructured":"Jansen, K., Kraft, S.: An improved approximation scheme for variable-sized bin packing. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 529\u2013541. Springer, Heidelberg (2012)"},{"key":"2_CR7","unstructured":"Jansen, K., Kraft, S.: An improved approximation scheme for variable-sized bin packing. Tech. Rep. 1301, Christian-Albrechts-Universit\u00e4t zu Kiel (2013) ISSN 2192-6247"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1109\/SFCS.1982.61","volume-title":"23rd Annual Symposium on Foundations of Computer Science (FOCS 1982)","author":"N. Karmarkar","year":"1982","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: 23rd Annual Symposium on Foundations of Computer Science (FOCS 1982), November 3-5, pp. 312\u2013320. IEEE Computer Society, Chicago (1982)"},{"key":"2_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"E.L. Lawler","year":"1979","unstructured":"Lawler, E.L.: Fast approximation algorithms for knapsack problems. Mathematics of Operations Research\u00a04(4), 339\u2013356 (1979)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0377-2217(81)90175-2","volume":"8","author":"M.J. Magazine","year":"1981","unstructured":"Magazine, M.J., Oguz, O.: A fully polynomial approximation algorithm for the 0-1 knapsack problem. European Journal of Operational Research\u00a08(3), 270\u2013273 (1981)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/0216012","volume":"16","author":"F.D. Murgolo","year":"1987","unstructured":"Murgolo, F.D.: An efficient approximation scheme for variable-sized bin packing. SIAM Journal on Computing\u00a016(1), 149\u2013161 (1987)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"S.A. Plotkin","year":"1995","unstructured":"Plotkin, S.A., Shmoys, D.B., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research\u00a020(2), 257\u2013301 (1995)","journal-title":"Mathematics of Operations Research"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/321864.321873","volume":"22","author":"S. Sahni","year":"1975","unstructured":"Sahni, S.: Approximate algorithms for the 0\/1 knapsack problem. Journal of the ACM\u00a022, 115\u2013124 (1975)","journal-title":"Journal of the ACM"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-74240-1_42","volume-title":"Fundamentals of Computation Theory","author":"H. Shachnai","year":"2007","unstructured":"Shachnai, H., Yehezkely, O.: Fast asymptotic FPTAS for packing fragmentable items with costs. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol.\u00a04639, pp. 482\u2013493. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T16:31:47Z","timestamp":1557765107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}