Optimal rectangle packing

DOI10.1007/s10479-008-0463-6zbMath1201.90172OpenAlexW2077575565MaRDI QIDQ610984

Michael D. Moffitt, Martha E. Pollack, Richard E. Korf

Publication date: 13 December 2010

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0463-6

zbMATH Keywords

searchconstraint satisfactionrectangle packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Logic based Benders' decomposition for orthogonal stock cutting problems, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, Models and algorithms for packing rectangles into the smallest square, A cutting plane method and a parallel algorithm for packing rectangles in a circular container, Automatic generation of dominance breaking nogoods for a class of constraint optimization problems, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, Packing a rectangle with m x (m + 1) rectangles, Rectangle packing with additional restrictions, Local search with a SAT oracle for combinatorial optimization, LP bounds in various constraint programming approaches for orthogonal packing, Exact solution techniques for two-dimensional cutting and packing, A hybrid metaheuristic for the two-dimensional strip packing problem, Probabilistic analysis of shelf algorithms for strip packing

Uses Software

• Chaff

Cites Work

• Unnamed Item
• Unnamed Item
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• Efficient solution techniques for disjunctive temporal reasoning problems
• Lower bounds and reduction procedures for the bin packing problem
• Temporal constraint networks
• Backtracking algorithms for disjunctions of temporal constraints
• A new constraint programming approach for the orthogonal packing problem
• Sweep synchronization as a global propagation mechanism
• A new exact method for the two-dimensional orthogonal packing problem
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• Backtrack programming techniques
• The Three-Dimensional Bin Packing Problem
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
• Mechanizing Mathematical Reasoning
• From Propositional Satisfiability to Satisfiability Modulo Theories