Consecutive ones matrices for multi-dimensional orthogonal packing problems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Journal of Mathematical Modelling and Algorithms Année : 2012

Consecutive ones matrices for multi-dimensional orthogonal packing problems

Résumé

The multi-dimensional orthogonal packing problem (OPP) is a well studied decisional problem. Given a set of items with rectangular shapes, the problem is to decide whether there is a non-overlapping packing of these items in a rectangular bin. The rotation of items is not allowed. A powerful caracterization of packing configurations by means of interval graphs was recently introduced. In this paper, we propose a new algorithm using consecutive ones matrices as data structure. This new algorithm is then used to solve the two-dimensional orthogonal knapsack problem. Computational results are reported, which show its effectiveness.
Fichier principal
Vignette du fichier
paperAlgoKPjmma.pdf (183.17 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00652574 , version 1 (15-12-2011)

Licence

Identifiants

Citer

Cédric Joncour, Arnaud Pêcher. Consecutive ones matrices for multi-dimensional orthogonal packing problems. Journal of Mathematical Modelling and Algorithms, 2012, Journal of Mathematical Modelling and Algorithm, 11 (1), pp.23-44. ⟨10.1007/s10852-011-9167-z⟩. ⟨hal-00652574⟩
205 Consultations
213 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More