{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:40:04Z","timestamp":1748461204001,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200859"},{"type":"electronic","value":"9783319200866"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20086-6_13","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:27:10Z","timestamp":1434702430000},"page":"165-177","source":"Crossref","is-referenced-by-count":1,"title":["Online Knapsack of Unknown Capacity:"],"prefix":"10.1007","author":[{"given":"Daniele","family":"Diodati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristina M.","family":"Pinotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-05465-5_2","volume-title":"Robust and Online Large-Scale Optimization","author":"S Cicerone","year":"2009","unstructured":"Cicerone, S., D\u2019Angelo, G., Di Stefano, G., Frigioni, D., Navarra, A., Schachtebeck, M., Sch\u00f6bel, A.: Recoverable robustness in shunting and timetabling. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 28\u201360. Springer, Heidelberg (2009)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Conti, M., Crispo, B., Diodati, D., Nurminen, J.K., Pinotti, C.M., Teemaa, T.: Leveraging parallel communications for minimizing energy consumption on smartphones. IEEE Transactions on Parallel and Distributed Systems (to appear)","DOI":"10.1109\/TPDS.2014.2360693"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/978-3-319-08001-7_13","volume-title":"Approximation and Online Algorithms","author":"M Cygan","year":"2014","unstructured":"Cygan, M., Je\u017c, \u0141.: Online knapsack revisited. In: Kaklamanis, C., Pruhs, K. (eds.) WAOA 2013. LNCS, vol. 8447, pp. 144\u2013155. Springer, Heidelberg (2014)"},{"issue":"9","key":"13_CR4","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1057\/palgrave.jors.2601596","volume":"54","author":"S Das","year":"2003","unstructured":"Das, S., Ghosh, D.: Binary knapsack problems with random budgets. The Journal of the Operational Research Society 54(9), 970\u2013983 (2003)","journal-title":"The Journal of the Operational Research Society"},{"key":"13_CR5","unstructured":"Disser, Y., Klimm, M., Megow, N., Stiller, S.: Packing a knapsack of unknown capacity. In: Proc. of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS), LIPIcs, vol. 25, pp. 276\u2013287. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2013.09.013","volume":"540","author":"X Han","year":"2014","unstructured":"Han, X., Kawase, Y., Makino, K., Guo, H.: Online removable knapsack problem under convex function. Theor. Comput. Sci. 540, 62\u201369 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"13_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. 2380, pp. 293\u2013305. Springer, Heidelberg (2002)"},{"issue":"22","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1016\/j.ipl.2010.08.013","volume":"110","author":"X Iwamaa","year":"2010","unstructured":"Iwamaa, X., Zhang, G.: Online knapsack with resource augmentation. Information Processing Letters 110(22), 1016\u20131020 (2010)","journal-title":"Information Processing Letters"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.46.1.17","volume":"46","author":"AJ Kleywegt","year":"1998","unstructured":"Kleywegt, A.J., Papastavrou, J.D.: The dynamic and stochastic knapsack problem. Operations Research 46(1), 17\u201335 (1998)","journal-title":"Operations Research"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-05465-5_1","volume-title":"Robust and Online Large-Scale Optimization","author":"C Liebchen","year":"2009","unstructured":"Liebchen, C., L\u00fcbbecke, M., M\u00f6hring, R., Stiller, S.: The concept of recoverable robustness, linear programming recovery, and railway applications. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 1\u201327. Springer, Heidelberg (2009)"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1006\/jagm.1998.0954","volume":"29","author":"GS Lueker","year":"1998","unstructured":"Lueker, G.S.: Average-case analysis of off-line and on-line knapsack problems. J. of Algorithms 29(2), 277\u2013305 (1998)","journal-title":"J. of Algorithms"},{"issue":"1\u20133","key":"13_CR12","first-page":"73","volume":"68","author":"A Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Mathematical Programming 68(1\u20133), 73\u2013104 (1995)","journal-title":"Mathematical Programming"},{"key":"13_CR13","volume-title":"Knapsack problems","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack problems. J. Wiley & Sons, Chichester (1990)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Megow, N., Mestre, J.: Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints. In: Proc. of the 4th International Conference on Innovations in Theoretical Computer Science (ITCS), pp. 495\u2013504. ACM (2013)","DOI":"10.1145\/2422436.2422490"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Noga, J., Sarbua, V.: An online partially fractional knapsack problem. In: Proc. of the 8th Sym. Parallel Architectures, Algorithms and Networks (ISPAN), pp. 108\u2013112. IEEE Computer Society (2005)","DOI":"10.1109\/ISPAN.2005.19"},{"issue":"12","key":"13_CR16","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1287\/mnsc.42.12.1706","volume":"42","author":"JD Papastavrou","year":"1996","unstructured":"Papastavrou, J.D., Rajagopalan, S., Kleywegt, A.J.: The dynamic and stochastic knapsack problem with deadlines. Manage. Sci. 42(12), 1706\u20131718 (1996)","journal-title":"Manage. Sci."},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-540-92185-1_63","volume-title":"Internet and Network Economics","author":"Y Zhou","year":"2008","unstructured":"Zhou, Y., Chakrabarty, D., Lukose, R.: Budget constrained bidding in keyword auctions and online knapsack problems. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 566\u2013576. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20086-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:05:30Z","timestamp":1748459130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-20086-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200859","9783319200866"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20086-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}