Packing into the smallest square: worst-case analysis of lower bounds
From MaRDI portal
Publication:865748
DOI10.1016/j.disopt.2006.06.001zbMath1112.90066OpenAlexW1980099076MaRDI QIDQ865748
Michele Monaci, Silvano Martello, Alberto Caprara, Andrea Lodi
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
Related Items
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, Logic based Benders' decomposition for orthogonal stock cutting problems, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, Models and algorithms for packing rectangles into the smallest square, Online square-into-square packing
Cites Work
- Unnamed Item
- Unnamed Item
- A lower bound for the non-oriented two-dimensional bin packing problem
- Worst-case analysis of fast heuristics for packing squares into a square
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Resource augmentation in two-dimensional packing with orthogonal rotations
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Some packing and covering theorems
