An on-line algorithm for the rectangle packing problem with rejection

Authors:
Massimiliano Caramia;Stefano Giordan;Antonio Iovanella
Affiliations:
Istituto per le Applicazioni del Calcolo "M. Picone", Rome, Italy;Dipartimento di Informatica, Sistemi e Produzione, University of Rome "Tor Vergata", Rome, Italy and Centro Interdipartimentale "'Vito Volterra", University of Rome "Tor Vergata", Rome, Italy;Dipartimento di Informatica, Sistemi e Produzione, University of Rome "Tor Vergata", Rome, Italy
Venue:
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Year:
2003

Citing 9
Cited 1

A simple on-line bin-packing algorithm

Journal of the ACM (JACM)
Packing squares into a square

Journal of Parallel and Distributed Computing
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
Scheduling Parallel Machines On-line

SIAM Journal on Computing
Online computation and competitive analysis

Online computation and competitive analysis
A Review of the Application ofMeta-Heuristic Algorithms to 2D Strip Packing Problems

Artificial Intelligence Review
Developments from a June 1996 seminar on Online algorithms: the state of the art

Developments from a June 1996 seminar on Online algorithms: the state of the art
Recent advances on two-dimensional bin packing problems

Discrete Applied Mathematics
Online strip packing with modifiable boxes

Operations Research Letters

Online removable square packing

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper an on-line algorithmf or the Rectangle Packing Problemi s presented. The method is designed to be able to accept or reject incoming boxes to maximize efficiency. We provide a wide computational analysis showing the behavior of the proposed algorithmas well as a comparison with existing off-line heuristics.