Add to ORKGIn the classical bin packing problem, one is asked to pack items of various sizes into the minimum number of equal-sized bins. In the on-line version of this problem, the packer is given the items one by one and must immediately and irrevocably assign every item to its bin, without knowing the future items. Beginning with the first results in the early 1970's, we survey - from the worst case point of view - the approximation results obtained for on-line bin packing, higher dimensional versions of the problem, lower bourds on worst case ratios and related results
AbstractWe study a new variant of the online bin-packing problem, in which each item ai is associate...
In this paper, two new algorithms for on-line bin packing are given, under the assumption that each ...
We study the on-line bin packing problem (BPP). In BPP, we are given a sequence B of items and a se...
In the classical bin packing problem, one is asked to pack items of various sizes into the minimum n...
Abstract. In the bin packing problem we are given an instance consist-ing of a sequence of items wit...
AbstractThis paper investigates a new version of the on-line variable-sized bin packing problem. Sup...
The bin packing problem asks for a packing of a list of items from (0, 1] into the smallest possible...
AbstractUsually, for bin packing problems, we try to minimize the number of bins used or in the case...
The bin-packing problem asks for a packing of a list of items of sizes from (0, 1) into the smallest...
The survey presents an overview of approximation algorithms for the classical bin packing problem an...
URL des Cahiers : http://mse.univ-paris1.fr/MSEFramCahier2006.htmCahiers de la Maison des Sciences E...
AbstractThe bin-packing problem asks for a packing of a list of items of sizes from (0,1] into the s...
This thesis gives a survey of the bin packing problems. Bin packing problems address the problem of ...
AbstractThe classical bin packing problem is one of the best-known and most widely studied problems ...
textabstractIn this paper we discuss lower bounds for the asymptotic worst case ratio of on-line alg...
AbstractWe study a new variant of the online bin-packing problem, in which each item ai is associate...
In this paper, two new algorithms for on-line bin packing are given, under the assumption that each ...
We study the on-line bin packing problem (BPP). In BPP, we are given a sequence B of items and a se...
In the classical bin packing problem, one is asked to pack items of various sizes into the minimum n...
Abstract. In the bin packing problem we are given an instance consist-ing of a sequence of items wit...
AbstractThis paper investigates a new version of the on-line variable-sized bin packing problem. Sup...
The bin packing problem asks for a packing of a list of items from (0, 1] into the smallest possible...
AbstractUsually, for bin packing problems, we try to minimize the number of bins used or in the case...
The bin-packing problem asks for a packing of a list of items of sizes from (0, 1) into the smallest...
The survey presents an overview of approximation algorithms for the classical bin packing problem an...
URL des Cahiers : http://mse.univ-paris1.fr/MSEFramCahier2006.htmCahiers de la Maison des Sciences E...
AbstractThe bin-packing problem asks for a packing of a list of items of sizes from (0,1] into the s...
This thesis gives a survey of the bin packing problems. Bin packing problems address the problem of ...
AbstractThe classical bin packing problem is one of the best-known and most widely studied problems ...
textabstractIn this paper we discuss lower bounds for the asymptotic worst case ratio of on-line alg...
AbstractWe study a new variant of the online bin-packing problem, in which each item ai is associate...
In this paper, two new algorithms for on-line bin packing are given, under the assumption that each ...
We study the on-line bin packing problem (BPP). In BPP, we are given a sequence B of items and a se...