Semi-online models where decisions may be revoked in a limited way have been studied extensively the last years. A well-studied measure of amount that can is (constant) migration factor. When an object arrives, for objects total size at most factor times its revoked. This means small only leads to changes. We study bin covering problem with different scenarios. develop algorithms both static ca...

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

Bin packing and bin covering are important optimization problems in many industrial fields, such as packaging, recycling, food processing. The problem concerns a set of items, each with its own value, that to be sorted into bins way the total value bin, measured by sum item values, is not above (for packing) or below covering) given target value. minimizing, for packing, maximizing, covering, n...

The paper described a generalized integrated glance to bin packing problems including a brief literature survey and some new problem formulations for the cases of multiset estimates of items. A new systemic viewpoint to bin packing problems is suggested: (a) basic element sets (item set, bin set, item subset assigned to bin), (b) binary relation over the sets: relation over item set as compatib...

We use game theory techniques to automatically compute improved lower bounds on the competitive ratio for the bin stretching problem. Using these techniques, we improve the best lower bound for this problem to 19/14. We explain the technique and show that it can be generalized to compute lower bounds for any online or semi-online packing or scheduling problem. We also present a lower bound, wit...

Bin covering takes as input a list of item sizes and places them into bins of unit demand so as to maximize the number of bins whose demand is satissed. This is in a sense a dual problem to the classical one-dimensional bin packing problem, but has for many years lagged behind the latter as far as the quality of the best approximation algorithms. We design algorithms for this problem that close...

abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...