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.
Caramia, M., Giordani, S., Iovanella, A. (2003). An On-line algorithm for the rectangle packing problem with rejection. ??????? it.cilea.surplus.oa.citation.tipologie.CitationProceedings.prensentedAt ??????? WEA-03.
An On-line algorithm for the rectangle packing problem with rejection
CARAMIA, MASSIMILIANO;GIORDANI, STEFANO;IOVANELLA, ANTONIO
2003-01-01
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
