Optimal rectangle packing
From MaRDI portal
Publication:610984
DOI10.1007/S10479-008-0463-6zbMATH Open1201.90172OpenAlexW2077575565MaRDI QIDQ610984FDOQ610984
Authors: Richard E. Korf, Michael D. Moffitt, M. E. Pollack 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Temporal constraint networks
- The Three-Dimensional Bin Packing Problem
- A new exact method for the two-dimensional orthogonal packing problem
- 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
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- A new constraint programming approach for the orthogonal packing problem
- Backtrack programming techniques
- From Propositional Satisfiability to Satisfiability Modulo Theories
- Sweep synchronization as a global propagation mechanism
- Backtracking algorithms for disjunctions of temporal constraints
- Title not available (Why is that?)
- Mechanizing Mathematical Reasoning
Cited In (38)
- Exact solution techniques for two-dimensional cutting and packing
- Exhaustive approaches to 2D rectangular perfect packings
- Optimal rectangle packing: an absolute placement approach
- The non-stop disjoint trajectories problem
- Automated placement of analog integrated circuits using priority-based constructive heuristic
- Minimum tiling of a rectangle by squares
- \(\gamma\)-soft packings of rectangles
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Chips on wafers, or packing rectangles into grids
- Local search with a SAT oracle for combinatorial optimization
- Packing a rectangle with m x (m + 1) rectangles
- Best packing of rods into boxes
- Expected wasted space of optimal simple rectangle packing
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- A novel non-linear approach to minimal area rectangular packing
- Almost square packing
- LP bounds in various constraint programming approaches for orthogonal packing
- Symmetry-breaking constraints for packing identical rectangles within polyhedra
- Combinatorial optimization model of packing rectangles with stochastic parameters
- Automatic generation of dominance breaking nogoods for a class of constraint optimization problems
- A reduction approach for solving the rectangle packing area minimization problem
- 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
- Exploiting functional constraints in automatic dominance breaking for constraint optimization
- An effective quasi-human based heuristic for solving the rectangle packing problem
- Chips on wafers (extended abstract)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
- Packing squares independently
- A hybrid metaheuristic for the two-dimensional strip packing problem
- Packing into the smallest square: worst-case analysis of lower bounds
- Exact and approximation algorithms for a soft rectangle packing problem
- Oriented aligned rectangle packing problem
- Rectangle packing with additional restrictions
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Probabilistic analysis of shelf algorithms for strip packing
- Bounds on soft rectangle packing ratios
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Optimal rectangle packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q610984)
