Exhaustive approaches to 2D rectangular perfect packings
From MaRDI portal
Publication:2390210
DOI10.1016/J.IPL.2004.01.006zbMATH Open1170.90523OpenAlexW2126819110MaRDI QIDQ2390210FDOQ2390210
Neal Lesh, Michael Mitzenmacher, Joe Marks, A. McMahon
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
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Two-dimensional packing problems: a survey
- Title not available (Why is that?)
- Orthogonal Packings in Two Dimensions
- A algorithm for two-dimensional packing
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A typology of cutting and packing problems
- An exact approach to the strip-packing problem
- Title not available (Why is that?)
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- A 2.5 times optimal algorithm for packing in two dimensions
- New heuristic and interactive approaches to 2D rectangular strip packing
- Backtrack programming techniques
- Title not available (Why is that?)
- An improved BL lower bound
Cited In (27)
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
- Exact solution techniques for two-dimensional cutting and packing
- Exact solution of the 2-dimensional grid arrangement problem
- New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles
- New filtering for the cumulative constraint in the context of non-overlapping rectangles
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A simple randomized algorithm for two-dimensional strip packing
- Metaheuristics for truck loading in the car production industry
- The multiple container loading cost minimization problem
- An exact method for the 2D guillotine strip packing problem
- Small polyomino packing
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- A branch and bound algorithm for the strip packing problem
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- An exact strip packing algorithm based on canonical forms
- Single workgroup scheduling problem with variable processing personnel
- Corner occupying theorem for the two-dimensional integral rectangle packing problem
- Combinatorial Benders' Cuts for the Strip Packing Problem
- Order and static stability into the strip packing problem
- Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic
- On packing squares into a rectangle
This page was built for publication: Exhaustive approaches to 2D rectangular perfect packings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390210)
