Vector bin packing with multiple-choice (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6139 LNCS, Issue , 2010, Pages 248-259

  Patt Shamir, Boaz ^a   Rawitz, Dror ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BIN PACKING; EXTENDED ABSTRACTS; GUARANTEED QUALITY; IN-NETWORK; MULTIDIMENSIONAL KNAPSACK; OTHER APPLICATIONS; OVERALL COSTS; RUNNING TIME; WEIGHT SET;

APPROXIMATION ALGORITHMS; QUALITY OF SERVICE;

BINS;

EID: 77954655280     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13731-0_24     Document Type: Conference Paper

References (26)

1. Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Prentice-Hall, Englewood Cliffs (1981)
2. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)
3. Warner, D., Prawda, J.: A mathematical programming model for scheduling nursing personnel in a hospital. Manage. Sci. (Application Series Part 1) 19, 411-422 (1972)
4. Fernandez de la Vega,W., Lueker, G.S.: Bin packing can be solved within 1+epsilon in linear time. Combinatorica 1(4), 349-355 (1981)
5. Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the onedimensional bin-packing problem. In: 23rd IEEE Annual Symposium on Foundations of Computer Science, pp. 312-320 (1982) (Pubitemid 13468520)
6. Friesen, D.K., Langston, M.A.: Variable sized bin packing. SIAM J. Comput. 15(1), 222-230 (1986)
7. Seiden, S.S., van Stee, R., Epstein, L.: New bounds for variable-sized online bin packing. SIAM J. Comput. 32(2), 455-469 (2003)
8. Correa, J.R., Epstein, L.: Bin packing with controllable item sizes. Information and Computation 206(18), 1003-1016 (2008)
9. Garey, M.R., Graham, R.L., Johnson, D.S., Yao, A.C.: Resource constrained scheduling as generalized bin packing. J. Comb. Theory, Ser. A 21(3), 257-298 (1976)
10. Chekuri, C., Khanna, S.: On multidimensional packing problems. SIAM J. Comput. 33(4), 837-851 (2004)
11. 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-708 (2006) (Pubitemid 351175557)
12. Sahni, S.: Approximate algorithms for the 0/1 knapsack problem. J. ACM 22(1), 115-124 (1975)
13. Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22(4), 463-468 (1975)
14. Frieze, A.M., Clarke, M.R.B.: Approximation algorithms for the m-dimensional 0-1 knapsack problem: worst-case and probabilistic analyses. Eur. J. Oper. Res. 15, 100-109 (1984)
15. Magazine, M.J., Chern, M.S.: A note on approximation schemes for multidimensional knapsack problems. Math. Oper. Res. 9(12), 244-247 (1984)
16. 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. 2764, pp. 165-177. Springer, Heidelberg (2003)
17. 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-668 (2001)
18. Hifi, M., Michrafy, M., Sbihi, A.: Heuristic algorithms for the multiple-choice multidimensional knapsack problem. J. Oper. Res. Soc. 55, 1323-1332 (2004)
19. Parra-Hernández, R., Dimopoulos, N.J.: A new heuristic for solving the multichoice multidimensional knapsack problem. IEEE Trans. on Systems, Man, and Cybernetics - Part A: Systems and Humans 35(5), 708-717 (2005)
20. 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 33, 1259-1273 (2006) (Pubitemid 41428290)
21. Khan, M.S.: Quality Adaptation in a Multisession Multimedia System: Model, Algorithms and Architecture. PhD thesis, Dept. of Electrical and Computer Engineering (1998)
22. Sbihi, A.: A best first search exact algorithm for the multiple-choice multidimensional knapsack problem. J. Comb. Optim. 13(4), 337-351 (2007)
23. Chandra, A.K., Hirschberg, D.S., Wong, C.K.: Approximate algorithms for some generalized knapsack problems. Theoretical Computer Science 3(3), 293-304 (1976)
24. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)
25. Plotkin, S.A., Shmoys, D.B., Tardos, É.: Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20, 257-301 (1995)
26. Grötschel, M., Lovasz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)