Models and algorithms for packing rectangles into the smallest square

DOI10.1016/J.COR.2015.04.024MaRDI QIDQ342053zbMATH OpenOpenAlexFDO

Authors Silvano Martello, Michele Monaci

Publication date 17 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2015.04.024

zbMATH Keywords

randomized algorithmmathematical modeltwo-dimensional packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20) Integer programming (90C10) Combinatorial aspects of packing and covering (05B40)

Recommendations

• Packing into the smallest square: worst-case analysis of lower bounds
• Optimal rectangle packing
• Almost square packing
• Minimum tiling of a rectangle by squares
• scientific article; zbMATH DE number 4091172

Cites work

• A lower bound for the non-oriented two-dimensional bin packing problem
• A method of optimal lattice packing of congruent oriented polygons in the plane
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• An Algorithm for Two-Dimensional Cutting Problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• An analytical model for the container loading problem
• An exact algorithm for general, orthogonal, two-dimensional knapsack problems
• An improved typology of cutting and packing problems
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• Conflict analysis in mixed integer programming
• Enumerating bottom-left stable positions for rectangle placements with overlap
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
• Local search algorithms for the rectangle packing problem with general spatial costs
• Optimal rectangle packing
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
• Orthogonal Packings in Two Dimensions
• Packing into the smallest square: worst-case analysis of lower bounds
• Resource augmentation in two-dimensional packing with orthogonal rotations
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• The Three-Dimensional Bin Packing Problem
• Two-dimensional bin packing problems
• Worst-case analysis of fast heuristics for packing squares into a square

Cited in

(13)

• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
• Optimal rectangle packing
• A hybrid chaos firefly algorithm for three-dimensional irregular packing problem
• Minimum tiling of a rectangle by squares
• 2D optimal packing with population based algorithms
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Exact solution techniques for two-dimensional cutting and packing
• Models of the nonguillotine sheet and strip rectangular packing problem
• Packing unequal rectangles and squares in a fixed size circular container using formulation space search
• Packing into the smallest square: worst-case analysis of lower bounds
• Logic based Benders' decomposition for orthogonal stock cutting problems
• Descending packing algorithm for irregular graphics based on geometric feature points
• Almost square packing

This page was built for publication: Models and algorithms for packing rectangles into the smallest square

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342053)