Flow reasoning has been successfully used in CP for more than a decade. It was originally introduced by Régin in the well-known Alldifferent and Global Cardinality Constraint (GCC) available in most of the CP solvers. The BinPacking constraint was introduced by Shaw and mainly uses an independent knapsack reasoning in each bin to filter the possible bins for each item. This paper considers the ...

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...