{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:05:10Z","timestamp":1725807910711},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319120539"},{"type":"electronic","value":"9783319120546"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12054-6_9","type":"book-chapter","created":{"date-parts":[[2014,10,23]],"date-time":"2014-10-23T06:40:51Z","timestamp":1414046451000},"page":"96-107","source":"Crossref","is-referenced-by-count":1,"title":["A Dynamic Approach for the Online Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Hajer","family":"Ben-Romdhane","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sihem","family":"Ben Jouida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saoussen","family":"Krichen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"9_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0436-0","volume":"97","author":"S. Albers","year":"2003","unstructured":"Albers, S.: Online algorithms: a survey. Mathematical Programming\u00a097(1-2), 3\u201326 (2003)","journal-title":"Mathematical Programming"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1287\/mnsc.42.12.1706","volume":"42","author":"J.D. Papastavrou","year":"1996","unstructured":"Papastavrou, J.D., Rajagopalan, S., Kleywegt, A.J.: The dynamic and stochastic knapsack problem with deadlines. Management Science\u00a042, 1706\u20131718 (1996)","journal-title":"Management Science"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Nazerzadeh, H., Saberi, A.: Online optimization with uncertain information. ACM Trans. Algorithms\u00a08, 2:1\u20132:29 (2012)","DOI":"10.1145\/2071379.2071381"},{"key":"9_CR4","first-page":"73","volume":"68","author":"A. Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Mathematical Programming\u00a068, 73\u2013104 (1995)","journal-title":"Mathematical Programming"},{"key":"9_CR5","unstructured":"Lueker, G.S.: Average-case analysis of off-line and on-line knapsack problems. In: SODA 1995: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 179\u2013188. Society for Industrial and Applied Mathematics (1995)"},{"key":"9_CR6","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":"9_CR7","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.) APPROX and RANDOM 2007. LNCS, vol.\u00a04627, pp. 180\u2013188. Springer, Heidelberg (2007)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-12450-1_17","volume-title":"Approximation and Online Algorithms","author":"X. Han","year":"2010","unstructured":"Han, X., Makino, K.: Online minimization knapsack problem. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol.\u00a05893, pp. 182\u2013193. Springer, Heidelberg (2010)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-32241-9_6","volume-title":"Computing and Combinatorics","author":"X. Han","year":"2012","unstructured":"Han, X., Kawase, Y., Makino, K.: Online knapsack problem with removal cost. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol.\u00a07434, pp. 61\u201373. Springer, Heidelberg (2012)"},{"key":"9_CR10","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.\u00a05385, pp. 566\u2013576. Springer, Heidelberg (2008)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-74208-1_2","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Babaioff","year":"2007","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.D.: A knapsack secretary problem with applications. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX and RANDOM 2007. LNCS, vol.\u00a04627, pp. 16\u201328. Springer, Heidelberg (2007)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.46.1.17","volume":"46","author":"J.D. Papastavrou","year":"1998","unstructured":"Papastavrou, J.D., Kleywegt, A.J.: The dynamic and stochastic knapsack problem. Operations Research\u00a046, 17\u201335 (1998)","journal-title":"Operations Research"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1287\/opre.49.1.26.11185","volume":"49","author":"J.D. Papastavrou","year":"2001","unstructured":"Papastavrou, J.D., Kleywegt, A.J.: The dynamic and stochastic knapsack problem with random sized items. Operations Research\u00a049, 26\u201341 (2001)","journal-title":"Operations Research"},{"key":"9_CR14","unstructured":"Kramer, A.D.I.: Delaying decisions in order to learn the distribution of options. PhD thesis (2010)"},{"issue":"5","key":"9_CR15","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1287\/opre.45.5.758","volume":"45","author":"D. Pisinger","year":"1997","unstructured":"Pisinger, D.: A minimal algorithm for the 0-1 knapsack problem. Operations Research\u00a045(5), 758\u2013767 (1997)","journal-title":"Operations Research"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1287\/opre.47.4.570","volume":"47","author":"D. Pisinger","year":"1999","unstructured":"Pisinger, D.: Core problems in knapsack algorithms. Operations Research\u00a047, 570\u2013575 (1999)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Modeling Decisions for Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12054-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T06:55:27Z","timestamp":1559026527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12054-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319120539","9783319120546"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12054-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}