Approximation schemes for ordered vector packing problems

DOI10.1002/nav.10058zbMath1045.90055OpenAlexW1966797778WikidataQ61638378 ScholiaQ61638378MaRDI QIDQ4456057

Hans Kellerer, Alberto Caprara, Ulrich Pferschy

Publication date: 15 March 2004

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.10058

zbMATH Keywords

approximation schemesvector packing problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (25)

Algorithms for on-line bin-packing problems with cardinality constraints ⋮ Bounds for online bin packing with cardinality constraints ⋮ The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints ⋮ Bin packing with rejection revisited ⋮ Vector bin packing with heterogeneous bins: application to the machine reassignment problem ⋮ An AFPTAS for variable sized bin packing with general activation costs ⋮ 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 ⋮ Bin packing with general cost structures ⋮ Improved results for a memory allocation problem ⋮ Bin covering with cardinality constraints ⋮ Robust algorithms for preemptive scheduling ⋮ Set Covering with Ordered Replacement: Additive and Multiplicative Gaps ⋮ Online interval coloring with packing constraints ⋮ Class constrained bin covering ⋮ Class constrained bin packing revisited ⋮ Approximation Schemes for Packing Splittable Items with Cardinality Constraints ⋮ Bin packing with controllable item sizes ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Unnamed Item ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Improved lower bounds for the online bin packing problem with cardinality constraints ⋮ Offline black and white bin packing

Cites Work

• Geometric algorithms and combinatorial optimization

This page was built for publication: Approximation schemes for ordered vector packing problems