Exhaustive approaches to 2D rectangular perfect packings
From MaRDI portal
Publication:2390210
DOI10.1016/j.ipl.2004.01.006zbMath1170.90523OpenAlexW2126819110MaRDI QIDQ2390210
A. McMahon, Neal Lesh, Michael Mitzenmacher, Joe Marks
Publication date: 21 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.01.006
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Small polyomino packing, Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic, A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem, Logic based Benders' decomposition for orthogonal stock cutting problems, A simple randomized algorithm for two-dimensional strip packing, An exact strip packing algorithm based on canonical forms, Corner occupying theorem for the two-dimensional integral rectangle packing problem, Combinatorial Benders' Cuts for the Strip Packing Problem, Single workgroup scheduling problem with variable processing personnel, An exact method for the 2D guillotine strip packing problem, The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview, A skyline heuristic for the 2D rectangular packing and strip packing problems, On packing squares into a rectangle, The multiple container loading cost minimization problem, Metaheuristics for truck loading in the car production industry, New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles, A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem, A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint, Order and static stability into the strip packing problem, New filtering for the cumulative constraint in the context of non-overlapping rectangles, Bidirectional best-fit heuristic for orthogonal rectangular strip packing, Exact solution techniques for two-dimensional cutting and packing, Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry, A branch and bound algorithm for the strip packing problem, Exact algorithms for the two-dimensional strip packing problem with and without rotations, Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A 2.5 times optimal algorithm for packing in two dimensions
- An improved BL lower bound
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- An Exact Approach to the Strip-Packing Problem
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Orthogonal Packings in Two Dimensions
- A algorithm for two-dimensional packing
- Backtrack programming techniques
- New heuristic and interactive approaches to 2D rectangular strip packing
