Optimal rectangle packing
type: Item
instance of: scholarly article
title: Optimal rectangle packing
zbMATH Open document ID: 1201.90172
author: Richard E. Korf
author: Michael D. Moffitt
author: M. E. Pollack
published in: Annals of Operations Research
publication date: 2010-12-13T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5826012
zbMATH Keywords: rectangle packing
zbMATH Keywords: constraint satisfaction
zbMATH Keywords: search
describes a project that uses: Chaff
MaRDI profile type: Publication
full work available at URL: s10479-008-0463-6
OpenAlex ID: W2077575565
cites work: Mechanizing Mathematical Reasoning
cites work: Q4475645
cites work: Sweep synchronization as a global propagation mechanism
cites work: Backtrack programming techniques
cites work: A new exact method for the two-dimensional orthogonal packing problem
cites work: A new constraint programming approach for the orthogonal packing problem
cites work: Temporal constraint networks
cites work: A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
cites work: A general framework for bounds for higher-dimensional orthogonal packing problems.
cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing
cites work: Q4198056
cites work: The Three-Dimensional Bin Packing Problem
cites work: Lower bounds and reduction procedures for the bin packing problem
cites work: From Propositional Satisfiability to Satisfiability Modulo Theories
cites work: Backtracking algorithms for disjunctions of temporal constraints
cites work: Efficient solution techniques for disjunctive temporal reasoning problems
DOI: 10.1007/S10479-008-0463-6
description: scientific article; zbMATH DE number 5826012