Class constrained bin packing revisited
- 17 July 2010
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 411 (34-36), 3073-3089
- https://doi.org/10.1016/j.tcs.2010.04.037
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Online Bin Packing with Cardinality ConstraintsSIAM Journal on Discrete Mathematics, 2006
- Algorithms for on-line bin-packing problems with cardinality constraintsDiscrete Applied Mathematics, 2004
- Approximation schemes for ordered vector packing problemsNaval Research Logistics (NRL), 2002
- Cardinality constrained bin‐packing problemsAnnals of Operations Research, 1999
- On-line bin packing in linear timeJournal of Algorithms, 1989
- A simple on-line bin-packing algorithmJournal of the ACM, 1985
- An efficient approximation scheme for the one-dimensional bin-packing problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981
- Errata: `` Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems''Journal of the ACM, 1977
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer SystemsJournal of the ACM, 1975