Back to Search
Start Over
Bin packing: Maximizing the number of pieces packed
- Source :
- Acta Informatica; September 1978, Vol. 9 Issue: 3 p263-271, 9p
- Publication Year :
- 1978
-
Abstract
- We consider a variant of the classical one-dimensional bin-packing problem: The number of bins is fixed and the object is to maximize the number of pieces packed from some given set. Both problems have applications in processor and storage allocation in computer systems in addition to a broad application in operations research.
Details
- Language :
- English
- ISSN :
- 00015903 and 14320525
- Volume :
- 9
- Issue :
- 3
- Database :
- Supplemental Index
- Journal :
- Acta Informatica
- Publication Type :
- Periodical
- Accession number :
- ejs15011059
- Full Text :
- https://doi.org/10.1007/BF00288885