Exhaustive approaches to 2D rectangular perfect packings

DOI10.1016/J.IPL.2004.01.006MaRDI QIDQ2390210zbMATH OpenOpenAlexFDO

Authors A. McMahon, Neal Lesh, Joe Marks, Michael Mitzenmacher

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

zbMATH Keywords

algorithmsbranch-and-boundstrip packing problemauthorperfect packing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• Exact algorithms for the two-dimensional strip packing problem with and without rotations
• Optimal rectangle packing
• Two-dimensional packing problems: a survey
• An exact algorithm for the two-dimensional strip-packing problem
• A branch and bound algorithm for the strip packing problem

Cites work

• scientific article; zbMATH DE number 3890754 (Why is no real title available?)
• scientific article; zbMATH DE number 2050771 (Why is no real title available?)
• A 2.5 times optimal algorithm for packing in two dimensions
• A algorithm for two-dimensional packing
• A typology of cutting and packing problems
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• An exact approach to the strip-packing problem
• An improved BL lower bound
• Backtrack programming techniques
• Bin completion algorithms for multicontainer packing, Knapsack, and covering problems
• New heuristic and interactive approaches to 2D rectangular strip packing
• Orthogonal Packings in Two Dimensions
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• Two-dimensional packing problems: a survey

Cited in

(27)

• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
• Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic
• Bidirectional best-fit heuristic for orthogonal rectangular strip packing
• New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles
• Metaheuristics for truck loading in the car production industry
• Exact solution techniques for two-dimensional cutting and packing
• New filtering for the cumulative constraint in the context of non-overlapping rectangles
• The multiple container loading cost minimization problem
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
• Corner occupying theorem for the two-dimensional integral rectangle packing problem
• A branch and bound algorithm for the strip packing problem
• A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
• Exact solution of the 2-dimensional grid arrangement problem
• On packing squares into a rectangle
• An exact method for the 2D guillotine strip packing problem
• A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
• Single workgroup scheduling problem with variable processing personnel
• A skyline heuristic for the 2D rectangular packing and strip packing problems
• Small polyomino packing
• Logic based Benders' decomposition for orthogonal stock cutting problems
• An exact strip packing algorithm based on canonical forms
• Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
• A simple randomized algorithm for two-dimensional strip packing
• Combinatorial Benders' cuts for the strip packing problem
• Order and static stability into 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

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)