On Packing Splittable Items with Cardinality Constraints

DOI10.1007/978-3-642-15240-5_8MaRDI QIDQ3163876zbMATH OpenOpenAlexFDO

Authors Fouad B. Chedid

Publication date 27 October 2010

Published in IFIP Advances in Information and Communication Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15240-5_8

Mathematics Subject Classification ID

Distributed systems (68M14) Computer system organization (68M99) Approximation algorithms (68W25)

Recommendations

• Approximation Schemes for Packing Splittable Items with Cardinality Constraints
• Approximation schemes for packing splittable items with cardinality constraints
• Cardinality constrained bin-packing problems
• Approximation and Online Algorithms
• Approximation schemes for packing with item fragmentation
• EPTAS for the dual of splittable bin packing with cardinality constraint
• Bin packing with fragmentable items: presentation and approximations
• Bin packing with divisible item sizes and rejection penalties
• Packing items into several bins facilitates approximating the separable assignment problem
• scientific article; zbMATH DE number 6842581

Cited in

(5)

• Approximation schemes for packing splittable items with cardinality constraints
• Improved results for a memory allocation problem
• PACKING SHELVES WITH ITEMS THAT DIVIDE THE SHELVES' LENGTH: A CASE OF A UNIVERSAL NUMBER PARTITION PROBLEM
• Improved Results for a Memory Allocation Problem
• Approximation Schemes for Packing Splittable Items with Cardinality Constraints

This page was built for publication: On Packing Splittable Items with Cardinality Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3163876)