A SAT encoding for multi-dimensional packing problems

DOI10.1007/978-3-642-13520-0_18MaRDI QIDQ3569928zbMATH OpenOpenAlexFDO

Authors C. Pinto, Stéphane Grandcolas

Publication date 22 June 2010

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://hal-amu.archives-ouvertes.fr/hal-02471124/file/CPAIOR2010-finale.pdf

Mathematics Subject Classification ID

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

Recommendations

• A SAT-based method for solving the two-dimensional strip packing problem
• Consecutive ones matrices for multi-dimensional orthogonal packing problems
• Consecutive ones matrices for multi-dimensional orthogonal packing problems
• A new constraint programming approach for the orthogonal packing problem
• MPQ-trees for orthogonal packing problem

Cited in

(5)

• Exact solution techniques for two-dimensional cutting and packing
• Combinatorial Benders' cuts for the strip packing problem
• A SAT-based method for solving the two-dimensional strip packing problem
• Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
• A new search procedure for the two-dimensional orthogonal packing problem

This page was built for publication: A SAT encoding for multi-dimensional packing problems

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