A constraint for bin packing

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

Volumn 3258, Issue , 2004, Pages 648-662

  Shaw, Paul ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPERATIONS RESEARCH;

BASED REASONINGS; BIN PACKING; BIN PACKING ALGORITHM; BIN PACKING PROBLEM; LOWER BOUNDS; ONE DIMENSIONAL BIN PACKINGS; PROPAGATION RULE; SEARCH STRATEGIES;

BINS;

EID: 34249052300     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_47     Document Type: Article

References (17)

1. J. Valerio de Carvalho. Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research, 86:629-659, 1999.
2. E. G. Coffman, Jr, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: A survery. In D. Hochbaum, editor, Appoximation algorithms for NP-Hard Problems, pages 46-93. PWS Publishing, Boston, 1996.
3. E. Falkenauer. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2:5-30, 1996.
4. D. K. Friesen and M. A. Langston. Variable sized bin packing. SIAM Journal on Computing, 15:222-230, 1986.
5. I. Gent and T. Walsh. From approximate to optimal solutions: Constructing pruning and propagation rules. In Proceedings of the 15th IJCAI, 1997.
6. I.P. Gent. Heuristic solution of open bin packing problems. Journal of Heuristics, 3:299-304, 1998.
7. ILOG S.A., Gentilly, France. ILOG Solver 6.0. User Manual, September 2003.
8. D. S. Johnson. Fast algorithms for bin packing. Journal of Computer and System Sciences, 8:272-314, 1974.
9. H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.
10. R. Korf. A new algorithm for optimal bin packing. In Proceedings of 18th AAAI, pages 731-736, 2002.
11. R. Korf. An improved algorithm for optimal bin packing. In Proceedings of the 18th IJCAI, pages 1252-1258, 2003.
12. S. Martello and P. Toth. Knapsack problems. Wiley, Chichester, 1990.
13. S. Martello and P. Toth. Lower bounds and reduction procedures for the bin packing problem. Discrete and Applied Mathematics, 28(1):59-70, 1990.
14. J.-C. Régin. A filtering algorithm for constraints of difference in CSPs. In Proceedings of the 12th AAAI, pages 362-367. American Association for Artificial Intelligence, AAAI Press / The MIT Press, 1994.
15. A. Scholl, R. Klein, and C. Jürgens. BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research, 24:627-645, 1997.
16. M. Sellmann. Approximated consistency for knapsack constraints. In Proceedings of the CP' 03, pages 679-693. Springer, 2003.
17. M. Trick. A dynamic programming approach for consistency and propagation for knapsack constraints. In Proceedings of CP-AI-OR '01, 2001.