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. 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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Grandcolas, S., & Pinto, C. (2010). A SAT encoding for multi-dimensional packing problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6140 LNCS, pp. 141–146). https://doi.org/10.1007/978-3-642-13520-0_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
