{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:14:13Z","timestamp":1725542053014},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106309"},{"type":"electronic","value":"9783642106316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_36","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T02:03:43Z","timestamp":1259892223000},"page":"341-351","source":"Crossref","is-referenced-by-count":2,"title":["Online Knapsack Problems with Limited Cuts"],"prefix":"10.1007","author":[{"given":"Xin","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","first-page":"761","volume":"222","author":"L.G. Babat","year":"1975","unstructured":"Babat, L.G.: Linear functions on the N-dimensional unit cube. Dokl. AKad. Nauk SSSR\u00a0222, 761\u2013762 (1975) (in Russian)","journal-title":"Dokl. AKad. Nauk SSSR"},{"issue":"1-2","key":"36_CR2","first-page":"15","volume":"10","author":"J. Csirik","year":"1991","unstructured":"Csirik, J., Frenk, J.B.G., Labb\u00e9, M., Zhang, S.: Heuristics for the 0-1 Min-Knapsack problem. Acta Cybernetica\u00a010(1-2), 15\u201320 (1991)","journal-title":"Acta Cybernetica"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0167-6377(99)00066-8","volume":"26","author":"M.M. G\u00fcntzer","year":"2000","unstructured":"G\u00fcntzer, M.M., Jungnickel, D.: Approximate minimization algorithms for the 0\/1 knapsack and subset-sum problem. Operations Research Letters\u00a026, 55\u201366 (2000)","journal-title":"Operations Research Letters"},{"issue":"3","key":"36_CR4","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/1008861.1008867","volume":"12","author":"G. Gene","year":"1980","unstructured":"Gene, G., Levner, E.: Complexity of approximation algorithms for combinatorial problems: a survey. ACM SIGACT News\u00a012(3), 52\u201365 (1980)","journal-title":"ACM SIGACT News"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/11940128_9","volume-title":"Algorithms and Computation","author":"T. Horiyama","year":"2006","unstructured":"Horiyama, T., Iwama, K., Kawahara, J.: Finite-State Online Algorithms and Their Automated Competitive Analysis. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 71\u201380. Springer, Heidelberg (2006)"},{"key":"36_CR6","unstructured":"Han, X., Makino, K.: Online minimization knapsack problem. In: WAOA (to appear, 2009)"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-45465-9_26","volume-title":"Automata, Languages and Programming","author":"K. Iwama","year":"2002","unstructured":"Iwama, K., Taketomi, S.: Removable online knapsack problems. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 293\u2013305. Springer, Heidelberg (2002)"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-74208-1_13","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"K. Iwama","year":"2007","unstructured":"Iwama, K., Zhang, G.: Optimal resource augmentations for online knapsack. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 180\u2013188. Springer, Heidelberg (2007)"},{"key":"36_CR9","doi-asserted-by":"crossref","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, Heidelberg (2004)"},{"key":"36_CR10","unstructured":"Lueker, G.S.: Average-case analysis of off-line and on-line knapsack problems. In: Proc. Sixth Annual ACM-SIAM SODA, pp. 179\u2013188 (1995)"},{"issue":"1, Ser. A","key":"36_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01585758","volume":"68","author":"A. Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Math. Programming\u00a068(1, Ser. A), 73\u2013104 (1995)","journal-title":"Math. Programming"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Noga, J., Sarbua, V.: An online partially fractional knapsack problem. In: ISPAN 2005, pp. 108\u2013112 (2005)","DOI":"10.1109\/ISPAN.2005.19"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:36:51Z","timestamp":1619768211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}