Summary . The bin packing problem is a fundamental and important optimization in theoretical computer science [4], [6]. An instance sequence of items, each being positive size at most one. task to place all the items into bins so that total one number contain least item minimum. Approximation algorithms have been intensively studied. Algorithm NextFit would be simplest algorithm repeatedly does...

This comprehensive work explores the research performed inoptimization of the collection bin and in recycle bin location-allocation issues in solidwaste management. Although the collection phase of solid waste management accountsfor a significant proportion of the municipal budget, it has attracted only limitedattention of the researchers. Optimization of the collection bin and recycle bin loca...

Online Bin Stretching is a semi-online variant of Bin Packing with a set number of m bins, where all bins can be overpacked to capacity S ≥ 1, which is to be minimized. There is also a guarantee that an offline algorithm can pack the input to m bins of unit size. We focus on the problem of Online Bin Stretching for small m, namely 3 ≤ m ≤ 5. Recent progress on this problem has led into a lower ...

Biomedical informatics in general and pharmacogenomics in particular require a research platform that simultaneously enables discovery while protecting research subjects' privacy and information confidentiality. The development of inexpensive DNA sequencing and analysis technologies promises unprecedented database access to very specific information about individuals. To allow analysis of this ...

The Municipal Solid Waste (MSW) management is a complex service that should be provided with suitable and feasible technologies in developing countries like India. The collection element plays a vital role in the MSW management. Hence, the planning and design of community bins make a greater impact on the environment. In this regard, an application model called Design of Community Storage Syste...

This paper continues the study of the the allocation of memory to processors in a pipeline problem. This problem can be modeled as a variation of bin packing where each item corresponds to a different type and the normalized weight of each item can be greater than 1, which is the size of a bin. Furthermore, in this problem, items may be split arbitrarily, but each bin may contain at most k type...

In this paper, we study the d-dimensional dynamic bin packing problem for general ddimensional boxes, for d ≥ 2. This problem is a generalization of the bin packing problem in which items may arrive and depart dynamically. Our main result is a 3-competitive online algorithm. We further study the 2and 3-dimensional problem closely and improve the competitive ratios. Technically speaking, our d-d...

We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem with unsplittable demands. The train delivery problem is strongly NP-Hard and does not admit an approximation ratio better than 3/2. We design two types of approximation schemes for the problem. We give an asymptotic polynomial...

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

We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard) bin packing problem with cardinality constraints which is an important version of bin packing, introduced by Krause, Shen and Schwetman already in 1975. Following previous work on the unbounded space online problem, we e...