Algorithms for the two dimensional bin packing problem with partial conflicts

DOI10.1051/ro/2012007zbMath1241.90109OpenAlexW2161352132MaRDI QIDQ2893341

Nacima Labadie, Khaoula Hamdi-Dhaoui, Alice Yalaoui

Publication date: 20 June 2012

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2012__46_1_41_0/

zbMATH Keywords

genetic algorithmbin-packingconflictsdistance constraint

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers

Cites Work

• Unnamed Item
• New lower bounds for bin packing problems with conflicts
• Packing cylinders and rectangular parallelepipeds with distances between them into a given region
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
• Heuristics and lower bounds for the bin packing problem with conflicts
• Fast algorithms for bin packing
• An approximation scheme for bin packing with conflicts
• Algorithms for the Bin Packing Problem with Conflicts
• Two-Dimensional Finite Bin-Packing Algorithms
• Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints

This page was built for publication: Algorithms for the two dimensional bin packing problem with partial conflicts