Cardinality constrained bin-packing problems

DOI10.1023/A:1018947117526zbMath0955.90106MaRDI QIDQ1960326

Ulrich Pferschy, Hans Kellerer

Publication date: 11 January 2000

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

worst-case analysisbin-packingvector packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Vehicle scheduling under the warehouse-on-wheels policy ⋮ Bounds for online bin packing with cardinality constraints ⋮ The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints ⋮ Polynomial time approximation schemes for class-constrained packing problems ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ Tight bounds for online class-constrained packing ⋮ Parameterized complexity of configuration integer programs ⋮ Selfish bin packing with cardinality constraints ⋮ Online bin packing with cardinality constraints resolved ⋮ EPTAS for the dual of splittable bin packing with cardinality constraint ⋮ Approximation schemes for packing splittable items with cardinality constraints ⋮ Improved results for a memory allocation problem ⋮ Bin covering with cardinality constraints ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Class constrained bin packing revisited ⋮ Constructive heuristics for the canister filling problem ⋮ Lower bounds for several online variants of bin packing ⋮ Approximation Schemes for Packing Splittable Items with Cardinality Constraints ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Unnamed Item ⋮ The influence of the fitness evaluation method on the performance of multiobjective search algorithms ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Improved lower bounds for the online bin packing problem with cardinality constraints