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

Abstract In a developing country like India faces challenges in waste management, due to an exceptional population growth and expansion. Research related the management shows that increase materials generated cities are difficult handle. The issues handle material is improper collection disposal of materials, toward big nonexistence intelligent technology leads environmental pollution. Manageme...

ONLINE BIN STRETCHING is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. We give an algorithm for ONLINE BIN STRETCHING with a stretching factor of 1.5 for any number of bins. We build o...

The vector bin packing problem (VBP) is a generalization of bin packing with multiple constraints. In this problem we are required to pack items, represented by p-dimensional vectors, into as few bins as possible. The multiple-choice vector bin packing (MVBP) is a variant of the VBP in which bins have several types and items have several incarnations. We present an exact method, based on an arc...

The main capability of the dual-frequency profiling radar proposed for deployment on the Aerosol/Cloud/Ecosystems (ACE) mission [1] is its ability to allow retrievals of vertical profiles of water content and mean hydrometeor size. At the center of this capability is the notion that measuring the radar reflectivity at two sufficiently different frequencies should allow the retrieval of two wate...

The benchmarks have been performed using an Intel Celeron M 1.5 GHz. The results are not too surprising: Obviously, the Next-Fit heuristic is fastest because only 1 bin has to be managed. However, due to the efficient data structure (a priority queue) that has been used for the Max-Rest heuristic, this heuristic will generally be almost as fast as Next-Fit. Furthermore, the implementation of th...