J. Csirik
http://repub.eur.nl/ppl/14427/
List of Publications
en
http://repub.eur.nl/eur_signature.png
http://repub.eur.nl/
RePub, Erasmus University Repository

Twodimensional rectangle packing: online methods and results
http://repub.eur.nl/pub/11700/
Fri, 03 Sep 1993 00:00:01 GMT
<div>J. Csirik</div><div>J.B.G. Frenk</div><div>M. LabbĂ©</div>
The first algorithms for the online twodimensional rectangle packing problem were introduced by Coppersmith and Raghavan. They showed that for a family of heuristics 13/4 is an upper bound for the asymptotic worstcase ratios. We have investigated the Next Fit and the First Fit variants of their method. We proved that the asymptotic worstcase ratio equals 13/4 for the Next Fit variant and that 49/16 is an upper bound of the asymptotic worstcase ratio for the First Fit variant.

Probabilistic analysis of algorithms for dual bin packing problems
http://repub.eur.nl/pub/11733/
Sat, 01 Jun 1991 00:00:01 GMT
<div>J. Csirik</div><div>J.B.G. Frenk</div><div>G. Galambos</div><div>A.H.G. Rinnooy Kan</div>
In the dual bin packing problem, the objective is to assign items of given size to the largest possible number of bins, subject to the constraint that the total size of the items assigned to any bin is at least equal to 1. We carry out a probabilistic analysis of this problem under the assumption that the items are drawn independently from the uniform distribution on [0, 1] and reveal the connection between this problem and the classical bin packing problem as well as to renewal theory.

On the multidimensional vector bin packing
http://repub.eur.nl/pub/11738/
Mon, 01 Jan 1990 00:00:01 GMT
<div>J.B.G. Frenk</div><div>J. Csirik</div><div>M. LabbĂ©</div><div>S. Zhang</div>

A probabilistic analysis of the next fit decreasing bin packing heuristic
http://repub.eur.nl/pub/11645/
Sat, 01 Nov 1986 00:00:01 GMT
<div>J. Csirik</div><div>G. Galambos</div><div>J.B.G. Frenk</div><div>A.M. Frieze</div><div>A.H.G. Rinnooy Kan</div>
A probabilistic analysis is presented of the Next Fit Decreasing bin packing heuristic, in which bins are opened to accomodate the items in order of decreasing size.