Cardinality constrained bin-packing problems
From MaRDI portal
Publication:1960326
DOI10.1023/A:1018947117526zbMath0955.90106MaRDI QIDQ1960326
Hans Kellerer, Ulrich Pferschy
Publication date: 11 January 2000
Published in: Annals of Operations Research (Search for Journal in Brave)
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Approximation Schemes for Packing Splittable Items with Cardinality Constraints, Tight bounds for online class-constrained packing, Class constrained bin packing revisited, Polynomial time approximation schemes for class-constrained packing problems, Constructive heuristics for the canister filling problem, Improved results for a memory allocation problem, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, The influence of the fitness evaluation method on the performance of multiobjective search algorithms