Algorithms for the two dimensional bin packing problem with partial conflicts
Khaoula Hamdi-Dhaoui; Nacima Labadie; Alice Yalaoui
RAIRO - Operations Research (2012)
- Volume: 46, Issue: 1, page 41-62
- ISSN: 0399-0559
Access Full Article
topAbstract
topHow to cite
topReferences
top- O. Beaumont, N. Bonichon and H. Larchevêque, Bin packing under distance constraint. Technical Report, Université de Bordeaux, Laboratoire Bordelais de Recherche en Informatique, INRIA Bordeaux Sud-Ouest (2010).
- S. Ben Messaoud, C. Chu and M.L. Espinouse, An approach to solve cutting stock sheets. Scottish Mathematical Council6 (2004) 5109–5113.
- J.O. Berkey and P.Y. Wang, Two dimensional finite bin packing algorithms. J. Oper. Res. Soc.38 (2004) 423–429.
- E.G. Coffman, M.R. Garey and D.S. Johnson, Approximation algorithms for bin-packing – an updated survey, in Algorithm design for computer system design, edited by G. Ausiello, M. Lucertini and P. Serafini. Springer, Vienna (2007).
- Environment Canada, Compliance promotion bulletin (Compro No. 12), regulations for the management of hazardous waste (2002).
- A.E. Fernandes-Muritiba, M. Iori, E. Malaguti and P. Toth, Algorithms for the bin packing problem with conflicts. Informs J. Comput.22 (2010) 401–415.
- M. Gendreau, G. Laporte and F. Semet, Heuristics and lower bounds for the bin packing problem with conflicts. Comput. Oper. Res.31 (2004) 347–358.
- J. Goupy, Les plans d’expériences. Revue Modulad34 (2006) 74–116.
- J.H. Holland, Adaptation in natural and artifficial systems. University of Michigan Press, Ann Arbor, MI (1975) 1–211.
- K. Jansen, An approximation Scheme for Bin Packing with conflicts, Lect. Notes Comput. Sci.1432. Springer, Berlin (1998).
- D. Johnson, Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci.9 (1974) 272–314.
- A. Khanafer, F. Clautiaux and E.G. Talbi, Tree-decomposition based tabu search for the bin packing problems with conflicts, in Metaheuristics International Conference, MIC09. Hamburg, Germany (2009).
- A. Khanafer, F. Clautiaux and E.G. Talbi, Algorithmes pour des problèmes de bin-packing mono et multi-objectif. Ph.D. thesis, Université des Sciences et Technologies de Lilles (2010).
- A. Khanafer, F. Clautiaux and E.G. Talbi, New lower bounds for bin packing problems with conflicts. Eur. J. Oper. Res.206 (2010) 281–288.
- Y.G. Stoyan and A. Chugay, Packing cylinders and rectangular parallelepipeds with distances between them into a given region. Eur. J. Oper. Res.360 (2009) 446–455.
- Y.G. Stoyan and G.N. Yaskov, Mathematical model and solution method of optimization problem of placement of rectangles and circles taking account special constraints. Int. Trans. Oper. Res.5 (1998) 45–57.
- Università di Bologna D.E.I.S., Operations Research, URIhttp://www.or.deis.unibo.it/ research.html.