Bin completion algorithms for multicontainer packing, knapsack, and covering problems

Journal of Artificial Intelligence Research

Volumn 28, Issue , 2007, Pages 393-429

  Fukunaga, Alex S ^a   Korf, Richard E ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b Engineering IV   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MULTI AGENT SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES; RESOURCE ALLOCATION; SEARCH ENGINES;

COMPLETION ALGORITHMS; KNAP-SACK PROBLEMS; SCHEDULING PROBLEMS;

OPTIMIZATION;

EID: 34249077551     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2106     Document Type: Article

References (41)

1. Assmann, S., Johnson, D., Kleitman, D., & Leung, J. (1984). On a dual version of the one-dimensional binpacking problem. Journal of Algorithms, 5, 502-525.
2. Belov, G., & Scheithauer, G. (2006). A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. European Journal of Operational Research, 171, 85-106.
3. Caprara, A., Kellerer, H., & Pferchy, U. (2000a). A PTAS for the multiple-subset sum problem with different knapsack capacities. Information Processing Letters, 73, 111-118.
4. Caprara, A., Kellerer, H., & Pferschy, U. (2000b). The multiple subset sum problem. SIAM Journal of Optimization, 11, 308-319.
5. Caprara, A., Kellerer, H., & Pferschy, U. (2003). A 3/4-approximation algorithm for multiple subset sum. Journal of Heuristics, 9, 99-111.
6. Carlyle, M., Knutson, K., & Fowler, J. (2001). Bin covering algorithms in the second stage of the lot to order matching problem. Journal of the Operational Research Society, 52, 1232-1243.
7. Cattrysse, D., & Wassenhove, L. V. (1992). A survey of algorithms for the generalized assignment problem. European Journal of Operational Research, 60, 260-272.
8. Christofides, N., Mingozzi, A., & Toth, P. (1979). Loading problems. In Christofides, N., Mingozzi, A., Toth, P., & Sandi, C. (Eds.), Combinatorial Optimization. John Wiley & Sons.
9. Csirik, J., Frenk, J., Galambos, G., & Kan, A. R. (1991). Probabilistic analysis of algorithms for dual bin packing problems. Journal of Algorithms, 12, 189-203.
10. Csirik, J., Johnson, D., & Kenyon, C. (2001). Better approximation algorithms for bin covering. In Proc. of the 12th ACM/SIAM Symposium on Discrete Algorithms, pp. 557-566.
11. Dell'Amico, M., & Martello, S. (1995). Optimal scheduling of tasks on identical parallel processors. ORSA Journal on Computing, 7(2), 181-200.
12. Eilon, S., & Christofides, N. (1971). The loading problem. Management Science, 17(5), 259-268.
13. Evans, J., & Tsubakitani, S. (1993). Solving the segregated storage problem with Benders' partitioning. Journal of the Operational Research Society, 44(2), 175-184.
14. Fahle, T., Schamberger, S., & Sellmann, M. (2001). Symmetry breaking. In Proceedings of the International Conference on Constraint Programming, pp. 93-107.
15. Focacci, F., & Milano, M. (2001). Global cut framework for removing symmetries. In Proceedings of the International Conference on Constraint Programming, pp. 77-92.
16. Focacci, F., & Shaw, P. (2002). Pruning sub-optimal search branch brances using local search. In Proc. Fourth International Workshop on Integration of AI and OR Techniques in Construing Programming for Combinatorial Optimisation Problems (CP-AI-OR), pp. 181-189.
17. Foster, D., & Vohra, R. (1989). Probabilistic analysis of a heuristic for the dual bin packing problem. Information Processing Letters, 31, 287-290.
18. Fukunaga, A. (2005). Bin-Completion Algorithms for One Dimensional, Multicontainer Packing Problems. Ph.D. thesis, UCLA.
19. Gent, I., & Smith, B. (2000). Symmetry breaking during search in constraint programming. In Proc. European Conference on Artificial Intelligence, pp. 599-603.
20. Gilmore, P., & Gomory, R. (1961). A linear programming approach to the cutting stock problem. Operations Research, 9, 849-859.
21. Gomes, C., & Selman, B. (2001). Algorithm portfolios. Artificial Intelligence, 126, 43-62.
22. Huberman, B., Lukose, R., & Hogg, T. (1997). An economic approach to hard computational problems. Science, 265, 51-54.
23. Kalagnanam, J., Davenport, A., & Lee, H. (2001). Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand. Electronic Commerce Research, 1, 221-238.
24. Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack Problems. Springer-Verlag.
25. Korf, R. (2002). A new algorithm for optimal bin packing. In Proceedings of AAAI, pp. 731-736.
26. Korf, R. (2003). An improved algorithm for optimal bin packing. In Proceedings of the International Joint Conference on Artificial Intelligence, pp. 1252-1258.
27. Labbé, M., Laporte, G., & Martello, S. (1995). An exact algorithm for the dual bin packing problem. Operations Research Letters, 17, 9-18.
28. Labbé, M., Laporte, G., & Martello, S. (2003). Upper bounds and algorithms for the maximum cardinality bin packing problem. European Journal of Operational Research, 149, 490-498.
29. Martello, S., & Toth, P. (1977). An upper bound for the zero-one knapsack problem and a branch and bound algorithm. European Journal of Operational Research, 1, 169-175.
30. Martello, S., & Toth, P. (1981). A bound and bound algorithm for the zero-one multiple knapsack problem. Discrete Applied Mathematics, 3, 275-288.
31. Martello, S., & Toth, P. (1990). Knapsack problems: algorithms and computer implementations. John Wiley & Sons.
32. Mitchell, D., Selman, B., & Levesque, H. (1992). Hard and easy distributions of SAT problems. In Proceedings of AAAI, pp. 459-65.
33. Neebe, A. (1987). An improved, multiplier adjustment procedure for the segregated storage problem. Journal of the Operational Research Society, 38(9), 815-825.
34. Pisinger, D. (1999). An exact algorithm for large multiple knapsack problems. European Journal of Operational Research, 114, 528-541.
35. Rhee, W., & Talagrand, M. (1989). Optimal bin covering with items of random size. SIAM Journal on Computing, 18, 487-498.
36. Scholl, A., Klein, R., & Jürgens, C. (1997). BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers in Operations Research, 24(7), 627-645.
37. Shachnai, H., & Tamir, T. (2001a). On two class-constrained versions of the multiple knapsack problem. Algorithmic, 29, 442-467.
38. Shachnai, H., & Tamir, T. (2001b). Polynomial time approximation schemes for class-constrained packing problems. Journal of Scheduling, 4, 313-338.
39. Shaw, P. (2004). A constraint for bin packing. In Proceedings of 10th International Conference on the Principles and Practice of Constraint Programming 2004 (CP-2004), Lecture Notes in Computer Science Vol. 3258, pp. 648-662. Springer.
40. Valério de Carvalho, J. (2002). LP models for bin packing and cutting stock problems. European Journal of Operational Research, 141, 253-273.
41. Wäscher, G., & Gau, T. (1996). Heuristics for the integer one-dimensional cutting stock problem: A computational study. OR Spektrum, 18(3), 131-144.