{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:29Z","timestamp":1759637909053},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_24","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T07:00:50Z","timestamp":1276153250000},"page":"248-259","source":"Crossref","is-referenced-by-count":5,"title":["Vector Bin Packing with Multiple-Choice"],"prefix":"10.1007","author":[{"given":"Boaz","family":"Patt-Shamir","sequence":"first","affiliation":[]},{"given":"Dror","family":"Rawitz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","volume-title":"Combinatorial optimization : algorithms and complexity","author":"C.H. Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"24_CR2","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, Berlin (2004)"},{"key":"24_CR3","first-page":"411","volume":"19","author":"D. Warner","year":"1972","unstructured":"Warner, D., Prawda, J.: A mathematical programming model for scheduling nursing personnel in a hospital. Manage. Sci. (Application Series Part 1)\u00a019, 411\u2013422 (1972)","journal-title":"Manage. Sci. (Application Series Part 1)"},{"issue":"4","key":"24_CR4","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W. Fernandez de la Vega","year":"1981","unstructured":"Fernandez de la Vega, W., Lueker, G.S.: Bin packing can be solved within 1+epsilon in linear time. Combinatorica\u00a01(4), 349\u2013355 (1981)","journal-title":"Combinatorica"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: 23rd IEEE Annual Symposium on Foundations of Computer Science, pp. 312\u2013320 (1982)","DOI":"10.1109\/SFCS.1982.61"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"D.K. Friesen","year":"1986","unstructured":"Friesen, D.K., Langston, M.A.: Variable sized bin packing. SIAM J. Comput.\u00a015(1), 222\u2013230 (1986)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/S0097539702412908","volume":"32","author":"S.S. Seiden","year":"2003","unstructured":"Seiden, S.S., van Stee, R., Epstein, L.: New bounds for variable-sized online bin packing. SIAM J. Comput.\u00a032(2), 455\u2013469 (2003)","journal-title":"SIAM J. Comput."},{"issue":"18","key":"24_CR8","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1016\/j.ic.2008.04.005","volume":"206","author":"J.R. Correa","year":"2008","unstructured":"Correa, J.R., Epstein, L.: Bin packing with controllable item sizes. Information and Computation\u00a0206(18), 1003\u20131016 (2008)","journal-title":"Information and Computation"},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","volume":"21","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S., Yao, A.C.: Resource constrained scheduling as generalized bin packing. J. Comb. Theory, Ser. A\u00a021(3), 257\u2013298 (1976)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"4","key":"24_CR10","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1137\/S0097539799356265","volume":"33","author":"C. Chekuri","year":"2004","unstructured":"Chekuri, C., Khanna, S.: On multidimensional packing problems. SIAM J. Comput.\u00a033(4), 837\u2013851 (2004)","journal-title":"SIAM J. Comput."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Bansal, N., Caprara, A., Sviridenko, M.: Improved approximation algorithms for multidimensional bin packing problems. In: 47th IEEE Annual Symposium on Foundations of Computer Science, pp. 697\u2013708 (2006)","DOI":"10.1109\/FOCS.2006.38"},{"issue":"1","key":"24_CR12","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. J. ACM\u00a022(1), 115\u2013124 (1975)","journal-title":"J. ACM"},{"issue":"4","key":"24_CR13","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. J. ACM\u00a022(4), 463\u2013468 (1975)","journal-title":"J. ACM"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/0377-2217(84)90053-5","volume":"15","author":"A.M. Frieze","year":"1984","unstructured":"Frieze, A.M., Clarke, M.R.B.: Approximation algorithms for the m-dimensional 0\u2009\u2212\u20091 knapsack problem: worst-case and probabilistic analyses. Eur. J. Oper. Res.\u00a015, 100\u2013109 (1984)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"24_CR15","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/moor.9.2.244","volume":"9","author":"M.J. Magazine","year":"1984","unstructured":"Magazine, M.J., Chern, M.S.: A note on approximation schemes for multidimensional knapsack problems. Math. Oper. Res.\u00a09(12), 244\u2013247 (1984)","journal-title":"Math. Oper. Res."},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-3-540-45198-3_15","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"H. Shachnai","year":"2003","unstructured":"Shachnai, H., Tamir, T.: Approximation schemes for generalized 2-dimensional vector packing with application to data placement. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 165\u2013177. Springer, Heidelberg (2003)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Akbar, M. M., Manning, E.G., Shoja, G.C., Khan, S.: Heuristic solutions for the multiple-choice multi-dimension knapsack problem. In: International Conference on Computational Science-Part II, pp. 659\u2013668 (2001)","DOI":"10.1007\/3-540-45718-6_71"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1057\/palgrave.jors.2601796","volume":"55","author":"M. Hifi","year":"2004","unstructured":"Hifi, M., Michrafy, M., Sbihi, A.: Heuristic algorithms for the multiple-choice multidimensional knapsack problem. J. Oper. Res. Soc.\u00a055, 1323\u20131332 (2004)","journal-title":"J. Oper. Res. Soc."},{"issue":"5","key":"24_CR19","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1109\/TSMCA.2005.851140","volume":"35","author":"R. Parra-Hern\u00e1ndez","year":"2005","unstructured":"Parra-Hern\u00e1ndez, R., Dimopoulos, N.J.: A new heuristic for solving the multichoice multidimensional knapsack problem. IEEE Trans. on Systems, Man, and Cybernetics\u2014Part A: Systems and Humans\u00a035(5), 708\u2013717 (2005)","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics\u2014Part A: Systems and Humans"},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1016\/j.cor.2004.09.016","volume":"33","author":"M.M. Akbara","year":"2006","unstructured":"Akbara, M.M., Rahman, M.S., Kaykobad, M., Manning, E.G., Shoja, G.C.: Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls. Computers & Operations Research\u00a033, 1259\u20131273 (2006)","journal-title":"Computers & Operations Research"},{"key":"24_CR21","unstructured":"Khan, M.S.: Quality Adaptation in a Multisession Multimedia System: Model, Algorithms and Architecture. PhD thesis, Dept. of Electrical and Computer Engineering (1998)"},{"issue":"4","key":"24_CR22","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10878-006-9035-3","volume":"13","author":"A. Sbihi","year":"2007","unstructured":"Sbihi, A.: A best first search exact algorithm for the multiple-choice multidimensional knapsack problem. J. Comb. Optim.\u00a013(4), 337\u2013351 (2007)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"24_CR23","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(76)90048-7","volume":"3","author":"A.K. Chandra","year":"1976","unstructured":"Chandra, A.K., Hirschberg, D.S., Wong, C.K.: Approximate algorithms for some generalized knapsack problems. Theoretical Computer Science\u00a03(3), 293\u2013304 (1976)","journal-title":"Theoretical Computer Science"},{"key":"24_CR24","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":"24_CR25","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, \u00c9.: Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res.\u00a020, 257\u2013301 (1995)","journal-title":"Math. Oper. Res."},{"key":"24_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lovasz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:38:19Z","timestamp":1578519499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_24"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}