نتایج جستجو برای: collection bin

تعداد نتایج: 198018  

Journal: :European Journal of Operational Research 2013
Sven Oliver Krumke Clemens Thielen

We consider a variant of the generalized assignment problem (GAP) where the amount of space used in each bin is restricted to be either zero (if the bin is not opened) or above a given lower bound (aminimum quantity). We provide several complexity results for different versions of the problem and give polynomial time exact algorithms and approximation algorithms for restricted cases. For the mo...

2003
Richard E. Korf

Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that the sum of the numbers assigned to each bin does not exceed the bin capacity. We present two improvements to our previous bin-completion algorithm. The first speeds up the constant factor per node generation, and the s...

1996
Thomas Philip Runarsson Magnus Thor Jonsson Pall Jensson

This paper presents the use of genetic algorithms (GA) for solving the dual bin packing problem using fuzzy objectives. In bin packing problems, a list, L of items is to be packed into a minimum number of bins. In dual bin packing the items are packed into a maximum number of bins, assuring a minimum weight for each bin. We consider a class which we call dynamic dual bin packingg. Similar to th...

Journal: :Annals OR 2014
Torsten Buchwald Kirsten Hoffmann Guntram Scheithauer

We consider the two-dimensional bin packing problem (BPP): given a set of rectangular items, find the minimal number of rectangular bins needed to pack all items. Rotation of the items is not permitted. We show for any integer k ≥ 3 that at most k − 1 bins are needed to pack all items if every item fits into a bin and if the total area of items does not exceed k/4-times the bin area. Moreover, ...

Journal: :Math. Program. 2012
Leah Epstein Asaf Levin

Following the work of Anily et al., we consider a variant of bin packing, called BIN PACKING WITH GENERAL COST STRUCTURES (GCBP) and design an asymptotic fully polynomial time approximation scheme (AFPTAS) for this problem. In the classic bin packing problem, a set of one-dimensional items is to be assigned to subsets of total size at most 1, that is, to be packed into unit sized bins. However,...

Journal: :Theoretical Computer Science 2011

2014
Lee J. Johnston Kurt Rosentrater Adrienne Hilbrands Mark Whitney Gerald Shurson

2 West Central Research and Outreach Center, University of Minnesota, Morris; 3 Iowa State University, Ames, 4 Minnesota Extension Regional Office, Mankato; 5 Department of Animal Science, University of Minnesota, St. Paul II. Abstract: Two experiments were conducted to evaluate the effects of feed bin design and the use of passive agitators on flowability of feed containing 40% dried distiller...

Journal: :Journal of Computer Science 2022

To create green and smart cities, a planned WasteManagement System (WMS) is vital requirement. With the increase in urbanpopulation service delivery difficulties, cities are integratingtechnologies such as waste bins Radio Frequency Identification (RFID)tags into their day-to-day operations to make solid management andcontrol more effective. Fog computing becoming common insmart utilities it pr...

Journal: :Discrete Optimization 2005

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید