A SAT encoding for Multi-dimensional Packing Problems - Archive ouverte HAL Access content directly
Conference Papers Year :

A SAT encoding for Multi-dimensional Packing Problems

(1) , (1)
1

Abstract

The Orthogonal Packing Problem (OPP) consists in determining if a set of items can be packed into a given container. This decision problem is NP-complete. S. P. Fekete et al. modelled the problem in which the overlaps between the objects in each dimension are represented by interval graphs. In this paper we propose a SAT encoding of Fekete et al. characterization. Some results are presented, and the efficiency of this approach is compared with other SAT encodings.
Fichier principal
Vignette du fichier
CPAIOR2010-finale.pdf (109.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02471124 , version 1 (07-02-2020)

Identifiers

  • HAL Id : hal-02471124 , version 1

Cite

Stéphane Grandcolas, Cedric Pinto. A SAT encoding for Multi-dimensional Packing Problems. CPAIOR, Jun 2010, Bologna, Italy. ⟨hal-02471124⟩
22 View
102 Download

Share

Gmail Facebook Twitter LinkedIn More