A Reduction Algorithm for Packing ProblemsReport as inadecuate




A Reduction Algorithm for Packing Problems - Download this document for free, or read online. Document in PDF available to download.

* Corresponding author 1 G-SCOP ROSP - ROSP G-SCOP - Laboratoire des sciences pour la conception, l-optimisation et la production 2 G-SCOP OC - OC G-SCOP - Laboratoire des sciences pour la conception, l-optimisation et la production

Abstract : We present a reduction algorithm for packing problems. This reduction is very generic and can be applied to almost any packing problem such as bin packing, multi-dimensional bin packing, vector bin packing with or without heterogeneous bins, etc. It is based on a dominance applied in the compatibility graph of a partial solution and can be computed in polynomial time in the input size and the number of bins, even on instances with high-multiplicity encoding of the input.

Keywords : Vector Packing Bin Packing High-Multiplicity Multi-dimensional Packing Packing Reduction algorithm





Author: Michaël Gabay - Hadrien Cambazard - Yohann Benchetrit -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents