In this paper we present a dual approximation scheme for the class constrained shelf bin packing problem. In this problem, we are given bins of capacity 1, and n items of Q different classes, each item e with class ce and size se. The problem is to pack the items into bins, such that two items of different classes packed in a same bin must be in different shelves. Items in a same shelf are pack...

Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. This paper presents results for the opposite problems, where we would like to maximize the number of bins used or minimize the number or total size of accepted items. We consider off-line and on-line variants of the pr...

Let $A$ and $B$ be two unital $C^{*}$-algebras and $varphi:A rightarrow B$ be a linear map. In this paper, we investigate the structure of linear maps between two $C^{*}$-algebras that preserve a certain property or relation. In particular, we show that if $varphi$ is unital, $B$ is commutative and $V(varphi(a)^{*}varphi(b))subseteq V(a^{*}b)$ for all $a,bin A$, then $varphi$ is a $*$-homomorph...

The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow models, with the filtering of the bin packing constraint. Our experiments show that we often obtain significant improvements in runtime. The DP-flow model is a novel formulation of the problem.

This paper studies a variant of the three-dimensional bin packing problem (3D-BPP), where the bin height can be adjusted to the cartons it packs. The bins and cartons to be packed are assumed rectangular in shape. The cartons are allowed to be rotated into any one of the six positions that keep the carton edges parallel to the bin edges. This greatly increases the difficulty of finding a good s...

In this paper, we introduce the Generalized Bin Packing Problem with bindependent item profits (GBPPI), a variant of the Generalized Bin Packing Problem. In GBPPI, various bin types are available with their own capacities and costs. A set of compulsory and non-compulsory items are also given, with volume and bin-dependent profits. The aim of GBPPI is to determine an assignment of items to bins ...

BACKGROUND The biology of small cell ovarian carcinoma of the hypercalcemic type (SCCOHT), which is a rare and aggressive form of ovarian cancer, is poorly understood. Tumourigenicity, in vitro growth characteristics, genetic and genomic anomalies, and sensitivity to standard and novel chemotherapeutic treatments were investigated in the unique SCCOHT cell line, BIN-67, to provide further insig...

In this paper an approximation algorithm for the three-dimensional bin packing problem is proposed and its performance bound is investigated. To obtain such a bound a modified bin packing algorithm is considered for a two-dimensional problem with bounded bin and its area utilization is estimated. Finally, a hard example gives a lower bound of the performance bound. '