Online Bin Packing with Cardinality Constraints
- 1 January 2006
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 20 (4), 1015-1030
- https://doi.org/10.1137/050639065
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Algorithms for on-line bin-packing problems with cardinality constraintsDiscrete Applied Mathematics, 2004
- Approximation schemes for ordered vector packing problemsNaval Research Logistics (NRL), 2002
- Resource augmentation for online bounded space bin packingJournal of Algorithms, 2002
- Cardinality constrained bin‐packing problemsAnnals of Operations Research, 1999
- An on-line algorithm for variable-sized bin packingActa Informatica, 1989
- Variable Sized Bin PackingSIAM Journal on Computing, 1986
- A simple on-line bin-packing algorithmJournal of the ACM, 1985
- 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
- Fast algorithms for bin packingJournal of Computer and System Sciences, 1974