A SAT-based method for solving the two-dimensional strip packing problem

MaRDI QIDQ3005898zbMATH OpenFDO

Authors Takehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Hidetomo Nabeshima

Publication date 10 June 2011

Full work available at URL http://iospress.metapress.com/content/h263q57384187623/fulltext.html

zbMATH Keywords

Boolean satisfiabilityconstraint satisfaction problemSAT encodingstrip packing problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• An exact algorithm for the two-dimensional strip-packing problem
• Exact algorithms for the two-dimensional strip packing problem with and without rotations
• An exact strip packing algorithm based on canonical forms
• A SAT encoding for multi-dimensional packing problems
• A branch and bound algorithm for the strip packing problem

Cited in

(9)

• Exact solution techniques for two-dimensional cutting and packing
• meSAT: multiple encodings of CSP to SAT
• Triple-solution approach for the strip packing problem with two-staged patterns
• Combinatorial Benders' cuts for the strip packing problem
• aspartame: solving constraint satisfaction problems with answer set programming
• A SAT encoding for multi-dimensional packing problems
• Clingo goes linear constraints over reals and integers
• \textit{clingcon}: the next generation
• Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies

Describes a project that uses

Uses Software

• MiniSat
• SATIRE

This page was built for publication: A SAT-based method for solving the two-dimensional strip packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3005898)