Packing into the smallest square: worst-case analysis of lower bounds
From MaRDI portal
Publication:865748
DOI10.1016/J.DISOPT.2006.06.001zbMATH Open1112.90066OpenAlexW1980099076MaRDI QIDQ865748FDOQ865748
Authors: Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci 
Publication date: 20 February 2007
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.06.001
Recommendations
Cites Work
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Exact solution of the two-dimensional finite bin packing problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- A lower bound for the non-oriented two-dimensional bin packing problem
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Worst-case analysis of fast heuristics for packing squares into a square
- Resource augmentation in two-dimensional packing with orthogonal rotations
- Title not available (Why is that?)
- Some packing and covering theorems
- Title not available (Why is that?)
Cited In (6)
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Almost square packing
- Models and algorithms for packing rectangles into the smallest square
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Online square-into-square packing
This page was built for publication: Packing into the smallest square: worst-case analysis of lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q865748)
