Bin-completion algorithms for multicontainer packing and covering problems

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 117-124

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

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIN COVERINGS; BIN PACKING PROBLEM; BRANCH-AND-BOUND APPROACHES; LIQUID LOADING; PACKING AND COVERINGS; SEARCH EFFICIENCY; STATE OF THE ART;

ARTIFICIAL INTELLIGENCE; LOADING;

BINS;

EID: 69949187008     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. S.F. Assman, D.S. Johnson, D.J. Kleitman, and J.Y.T. Leung. On a dual version of the one-dimensional bin-packing problem. J. Algorithms, 5:502-525, 1984.
2. G. Belov and G. Scheithauer. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Technical report, Technical University Dresden, 2003. Preprint MATH-NM-03-2003.
3. N. Christofides, A. Mingozzi, and P. Toth. Loading problems. In N. Christofides, A. Mingozzi, P. Toth, and C. Sandi, editors, Combinatorial Optimization. John Wiley & Sons, 1979.
4. J.M. Valério de Carvalho. LP models for bin packing and cutting stock problems. European Journal of Operational Research, 141:253-273, 2002.
5. T. Fahle, S. Schamberger, and M. Sellmann. Symmetry breaking. In Proc. Int. Conference on Constraint Programming, pages 93-107, 2001.
6. F. Focacci and M. Milano. Global cut framework for removing symmetries. In Proc. Int. Conference on Constraint Programming, pages 77-92, 2001.
7. F. Focacci and P. Shaw. Pruning suboptimal search branch brances using local search. In Proc. CP-AI-OR, 2002.
8. A. Fukunaga. Bin-Completion Algorithms for One Dimensional, Multicontainer Packing Problems. PhD thesis, UCLA, 2005. forthcoming.
9. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
10. P.C. Gilmore and R.E. Gomory. A linear programming approach to the cutting stock problem. Operations Research, 9:849-859, 1961.
11. Carla P. Gomes, Bart Selman, and Henry Kautz. Boosting combinatorial search through randomization. In Proc. AAAI, pages 431-437, Madison, Wisconsin, 1998.
12. H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer-Verlag, 2004.
13. R. Korf. A new algorithm for optimal bin packing. In Proc. AAAI, pages 731-736, 2002.
14. R. Korf. An improved algorithm for optimal bin packing. In Proc. IJCAI, pages 1252-1258, 2003.
15. M. Labbé, G. Laporte, and S. Martello. An exact algorithm for the dual bin packing problem. Operations Research Letters, 17:9-18, 1995.
16. S. Martello and P. Toth. Knapsack problems: algorithms and computer implementations. John Wiley & Sons, 1990.
17. D. Pisinger. An exact algorithm for large multiple knapsack problems. European Journal of Operational Research, 114:528-541, 1999.
18. A. Scholl, R. Klein, and C. Jürgens. BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers in Operations Research, 24(7):627-645, 1997.
19. G. Wäscher and T. Gau. Heuristics for the integer one-dimensional cutting stock problem: A computational study. OR Spektrum, 18(3):131-144, 1996.