|
|
Volumn 2223 LNCS, Issue , 2001, Pages 695-706
|
|
On-line algorithms for cardinality constrained bin packing problems
a
|
|
Author keywords
Bin packing; Cardinality constraint; On line
|
|
Indexed keywords
ASYMPTOTIC WORST-CASE PERFORMANCE RATIO;
BIN PACKING;
BIN PACKING PROBLEM;
CARDINALITIES;
CARDINALITY CONSTRAINT;
EFFICIENT APPROXIMATION ALGORITHMS;
ON-LINE;
ON-LINE ALGORITHMS;
ONLINE VERSIONS;
UNIT CAPACITY;
CARDINALITY CONSTRAINTS;
ASYMPTOTIC ANALYSIS;
BINS;
COMPUTATION THEORY;
COMPUTATIONAL EFFICIENCY;
PHOTOVOLTAIC EFFECTS;
APPROXIMATION ALGORITHMS;
APPROXIMATION ALGORITHMS;
ALGORITHMS;
|
|
EID: 33646049754
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/3-540-45678-3_59 Document Type: Conference Paper |
|
Times cited : (4)
|
|
References (7)
|
