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

Time-bin encoding is a robust form of optical quantum information, especially for transmission in optical fibers. To readout the information, the separation of the time bins must be larger than the detector time resolution, typically on the order of nanoseconds for photon counters. In the present work, we demonstrate a technique using a nonlinear interaction between chirped entangled time-bin p...

In the age of Big Data the problem of storing huge volume of data in a minimum storage space by utilizing available resources properly is an open problem and an important research aspect in recent days. This problem has a close relationship with the famous classical NP-Hard combinatorial optimization problem namely the “Bin Packing Problem” where bins represent available storage space and the p...

In this paper we present a stereo vision based system for segmentation and location computation of partially occluded objects in bin picking environments. Algorithms to segment partially occluded objects and to find the object location [midpoint,x, y and z co‐ordinates] with respect to the bin area are proposed. The z co‐ ordinate is computed using stereo images and neural ...

We developed a marker based infinitesimal model for quantitative trait analysis. In contrast to the classical infinitesimal model, we now have new information about the segregation of every individual locus of the entire genome. Under this new model, we propose that the genetic effect of an individual locus is a function of the genome location (a continuous quantity). The overall genetic value ...