A Reduction Algorithm for Packing ProblemsReportar como inadecuado




A Reduction Algorithm for Packing Problems - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

* 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





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

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



DESCARGAR PDF




Documentos relacionados