Packing into the smallest square: worst-case analysis of lower bounds
type: Item
instance of: scholarly article
title: Packing into the smallest square: worst-case analysis of lower bounds
zbMATH Open document ID: 1112.90066
author: Alberto Caprara
author: Andrea Lodi
author: Silvano Martello
author: Michele Monaci
published in: Discrete Optimization
publication date: 2007-02-20T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5128390
zbMATH Keywords: packing
zbMATH Keywords: lower bound
zbMATH Keywords: worst-case
zbMATH Keywords: experiments
MaRDI profile type: Publication
full work available at URL: j.disopt.2006.06.001
OpenAlex ID: W1980099076
cites work: Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Resource augmentation in two-dimensional packing with orthogonal rotations
cites work: A lower bound for the non-oriented two-dimensional bin packing problem
cites work: Q3879875
cites work: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
cites work: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
cites work: Exact solution of the two-dimensional finite bin packing problem
cites work: Some packing and covering theorems
cites work: Q4220418
cites work: Worst-case analysis of fast heuristics for packing squares into a square
cites work: A Strip-Packing Algorithm with Absolute Performance Bound 2
DOI: 10.1016/J.DISOPT.2006.06.001
description: scientific article; zbMATH DE number 5128390