Recently, Renault (2016) studied the dual bin packing problem in the per-request advice model of online algorithms. He showed that given O(1/ǫ) advice bits for each input item allows approximating the dual bin packing problem online to within a factor of 1 + ǫ. Renault asked about the advice complexity of dual bin packing in the tape-advice model of online algorithms. We make progress on this q...

In many places, it can be seen that the Municipal garbage bins are overflowing and they are not cleaned at proper time. As a result of which the consequences are severe. It includes overflow of garbage which results in land pollution, spread of diseases. It also creates unhygienic conditions for people, and ugliness to that place. There should be a system that can monitor the bin and can give t...

Wild-type beta and gamma corynebacteriophages are heteroimmune and infect lysogens of each other productively. Unlike their wild-type counterparts, the bin mutants of each phage are excluded in lysogens carrying the heteroimmune phage. The wild-type phages overcome exclusion by means of the bin gene product which appears to act as an antirepressor. When repression is lifted, exclusion of bin mu...

In this paper we consider a more complicated real-world problem originating in the steel industry. The bins are inhomogeneous sheets with impurities. We assume that each impure area is rectangle. For each bin we are given a set of impurities, size, and location of each impurity into the bin. As a consequence now the bins are not identical anymore and the number of bins is finite. Moreover, we i...

The ordered open-end bin packing problem is a variant of the bin packing problem in which the items to be packed are sorted in a given order and the capacity of each bin can be exceeded by the last item packed into the bin. We present a branch-and-price algorithm for its exact optimization. The pricing subproblem is a special variant of the binary knapsack problem, in which the items are ordere...

In this paper, we study the on-line version of the bin-packing problem. We analyze the approximation behavior of an on-line bin-packing algorithm under an approximation criterion called differential ratio. We are interested in two types of results: the differential competitivity ratio guaranteed by the on-line algorithm and hardness results that account for the difficulty of the problem and for...

Three hypotheses were derived from research on vicarious revenge and tested in the context of the assassination of Osama bin Laden in 2011. In line with the notion that revenge aims at delivering a message (the "message hypothesis"), Study 1 shows that Americans' vengeful desires in the aftermath of 9/11 predicted a sense of justice achieved after bin Laden's death, and that this effect was med...

We consider the Variable Cost and Size Bin Packing Problem, a generalization of the well-known bin packing problem, where a set of items must be packed into a set of heterogeneous bins characterized by possibly different volumes and fixed selection costs. The objective of the problem is to select bins to pack all items at minimum total binselection cost. The paper introduces lower bounds and he...

The central-arbitrary bin and forward-backward bin multiplicity correlation patterns for Au+Au collisions at √ sNN= 7.7 − 62.4 GeV are investigated within a multi-phase transport (AMPT) model. An interesting observation is that for √ sNN < 19.6 GeV Au+Au collisions, these two correlation patterns both have an increase with the pseudorapidity gap, while for √ sNN > 19.6 GeV Au+Au collisions, the...