Cedric Pinto scite author profile

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.

show abstract

A Generalized Cyclic-Clustering Approach for Solving Structured CSPs

Pinto

Terrioux

2009

View full text Add to dashboard Cite

A New Method for Computing Suitable Tree-Decompositions with Respect to Structured CSP Solving

Pinto

Terrioux

2008

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Cedric Pinto

A New Search Procedure for the Two-dimensional Orthogonal Packing Problem

A SAT Encoding for Multi-dimensional Packing Problems

A Generalized Cyclic-Clustering Approach for Solving Structured CSPs

A New Method for Computing Suitable Tree-Decompositions with Respect to Structured CSP Solving

Contact Info

Product

Resources

About