A two-dimensional bin-packing problem with conflict penalties

References

• Alvarez-Valdes, R., F. Parreño, and J. M. Tamarit. 2005. “A Tabu Search Algorithm for the Pallet Loading Problem.” OR Spectrum 27 (1): 43–61.10.1007/s00291-004-0183-5
   Web of Science ®Google Scholar
• Berkey, J. O., and P. Y. Wang. 1987. “Two-dimensional Finite Bin-packing Algorithms.” Journal of the Operational Research Society 38 (5): 423–429.10.1057/jors.1987.70
   Web of Science ®Google Scholar
• Bortfeldt, A., H. Gehring, and D. Mack. 2003. “A Parallel Tabu Search Algorithm for Solving the Container Loading Problem.” Parallel Computing 29 (5): 641–662.10.1016/S0167-8191(03)00047-4
   Web of Science ®Google Scholar
• Diestel, R. 2000. Graph Theory. 2nd ed. New York: Springer.
   Google Scholar
• El Hayek, J., A. Moukrim, and S. Negre. 2008. “New Resolution Algorithm and Pretreatments for the Two-dimensional Bin-packing Problem.” Computers & Operations Research 35 (10): 3184–3201.
   Web of Science ®Google Scholar
• Elhedhli, S., L. Li, M. Gzara, and J. Naoum-Sawaya. 2011. “A Branch-and-price Algorithm for the Bin Packing Problem with Conflicts.” INFORMS Journal on Computing 23 (3): 404–415.10.1287/ijoc.1100.0406
   Web of Science ®Google Scholar
• Epstein, L., A. Levin, and R. Van Stee. 2008. “Two-dimensional Packing with Conflicts.” Acta Informatica 45 (3): 155–175.10.1007/s00236-007-0067-7
   Web of Science ®Google Scholar
• Epstein, L., L. M. Favrholdt, and A. Levin. 2011. “Online Variable-sized Bin Packing with Conflicts.” Discrete Optimization 8 (2): 333–343.10.1016/j.disopt.2010.11.001
   Web of Science ®Google Scholar
• Garey, M. R., and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. New York: WH Freeman and Company.
   Google Scholar
• Gendreau, M., G. Laporte, and F. Semet. 2004. “Heuristics and Lower Bounds for the Bin Packing Problem with Conflicts.” Computers & Operations Research 31: 347–358.
   Web of Science ®Google Scholar
• Glover, F. 1986. “Future Paths for Integer Programming and Links to Artificial Intelligence.” Computers & Operations Research 13 (5): 533–549.
   Web of Science ®Google Scholar
• Hamdi-Dhaoui, K., N. Labadie, and A. Yalaoui. 2012. “Algorithms for the Two Dimensional Bin Packing Problem with Partial Conflicts.” Rairo – Operations Research 46 (1): 41–62.10.1051/ro/2012007
   Web of Science ®Google Scholar
• Hansen, P., and B. Jaumard. 1990. “Algorithmen für Das Maximale Erfüllbarkeitsproblem.” [Algorithms for the Maximum Satisfiability Problem]. Computing 44 (4): 279–303.10.1007/BF02241270
   Web of Science ®Google Scholar
• Harwig, J. M., J. W. Barnes, and J. T. Moore. 2006. “An Adaptive Tabu Search Approach for 2-dimensional Orthogonal Packing Problems.” Military Operations Research 11 (2): 5–26.10.5711/morj.11.2.5
   Web of Science ®Google Scholar
• Jansen, K. 1999. “An Approximation Scheme for Bin Packing with Conflicts.” Journal of Combinatorial Optimization 3: 363–377.10.1023/A:1009871302966
   Web of Science ®Google Scholar
• Khanafer, A., F. Clautiaux, and E. G. Talbi. 2010. “New Lower Bounds for Bin Packing Problems with Conflicts.” European Journal of Operational Research 206 (2): 281–288.10.1016/j.ejor.2010.01.037
   Web of Science ®Google Scholar
• Khanafer, A., F. Clautiaux, S. Hanafi, and E. Talbi. 2012. “The Min-conflict Packing Problem.” Computers & Operations Research 39 (9): 2122–2132.
   Web of Science ®Google Scholar
• Khanafer, A., F. Clautiaux, and E. Talbi. 2012. “Tree-decomposition Based Heuristics for the Two-dimensional Bin Packing Problem with Conflicts.” Computers & Operations Research 39 (1): 54–63.
   Web of Science ®Google Scholar
• Laporte, G., and S. Desroches. 1984. “Examination Timetabling by Computer.” Computers & Operations Research 11 (3): 351–360.
   Web of Science ®Google Scholar
• Lodi, A., S. Martello, and M. Monaci. 2002. “Two-dimensional Packing Problems: A Survey.” European Journal of Operational Research 141 (2): 241–252.10.1016/S0377-2217(02)00123-6
   Web of Science ®Google Scholar
• Lodi, A., S. Martello, and D. Vigo. 2002. “Recent Advances on Two-dimensional Bin Packing Problems.” Discrete Applied Mathematics 123 (1–3): 379–396.10.1016/S0166-218X(01)00347-X
   Web of Science ®Google Scholar
• Lodi, A., S. Martello, and D. Vigo. 2004. “TSpack: A Unified Tabu Search Code for Multi-dimensional Bin Packing Problems.” Annals of Operations Research 131: 203–213.10.1023/B:ANOR.0000039519.03572.08
   Web of Science ®Google Scholar
• Muritiba, A. E. F., M. Iori, E. Malaguti, and P. Toth. 2010. “Algorithms for the Bin Packing Problem with Conflicts.” INFORMS Journal on Computing 22 (3): 401–415.10.1287/ijoc.1090.0355
   Web of Science ®Google Scholar
• Parreño, F., R. Alvarez-Valdes, J. M. Tamarit, and J. F. Oliveira. 2008. “A Maximal-space Algorithm for the Container Loading Problem.” INFORMS Journal on Computing 20 (3): 412–422.10.1287/ijoc.1070.0254
   Web of Science ®Google Scholar
• Parreño, F., R. Alvarez-Valdes, J. F. Oliveira, and J. M. Tamarit. 2010. “Neighborhood Structures for the Container Loading Problem: A VNS Implementation.” Journal of Heuristics 16 (1): 1–22.10.1007/s10732-008-9081-3
   Web of Science ®Google Scholar
• Riff, M. C., X. Bonnaire, and B. Neveu. 2009. “A Revision of Recent Approaches for Two-dimensional Strip-packing Problems.” Engineering Applications of Artificial Intelligence 22: 823–827.10.1016/j.engappai.2008.10.025
   Web of Science ®Google Scholar