Two- and three-dimensional parametric packing

Authors:
F. K. Miyazawa;Y. Wakabayashi
Affiliations:
Instituto de Computação, Universidade Estadual de Campinas, Caixa Postal 6176, 13084-971, Campinas-SP, Brazil;Instituto de Matemática e Estatística, Universidade de São Paulo, Rua do Matão, 1010, 05508-090, São Paulo, SP, Brazil
Venue:
Computers and Operations Research
Year:
2007

Citing 11
Cited 1

Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem

Computing
Static job scheduling in partitionable mesh connected systems

Journal of Parallel and Distributed Computing
On three-dimensional packing

SIAM Journal on Computing
The parametric behavior of the first-fit decreasing bin packing algorithm

Journal of Algorithms
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Exact Solution of the Two-Dimensional Finite Bon Packing Problem

Management Science
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem

SIAM Journal on Computing
The Three-Dimensional Bin Packing Problem

Operations Research
Recent advances on two-dimensional bin packing problems

Discrete Applied Mathematics
An Exact Approach to the Strip-Packing Problem

INFORMS Journal on Computing
Fast algorithms for bin packing

Journal of Computer and System Sciences

Three-dimensional packings with rotations

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present approximation algorithms for the two- and three-dimensional bin packing problems and the three-dimensional strip packing problem. We consider the special case of these problems in which a parameter m (a positive integer) is given, indicating that each of the dimensions of the items to be packed is at most 1/m of the corresponding dimension of the recipient. We analyze the asymptotic performance of these algorithms and exhibit bounds that, to our knowledge, are the best known for this special case.