PACKING SHELVES WITH ITEMS THAT DIVIDE THE SHELVES' LENGTH: A CASE OF A UNIVERSAL NUMBER PARTITION PROBLEM

DOI10.1142/S1793830910000565zbMATH Open1214.11138OpenAlexW2167866911MaRDI QIDQ3575375FDOQ3575375

Authors Moshe Dror, James B. Orlin

Publication date 27 July 2010

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830910000565

zbMATH Keywords

divisibility and packinguniversal number partition

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Number-theoretic algorithms; complexity (11Y16) Counting solutions of Diophantine equations (11D45)

Recommendations

• A one-dimensional bin packing problem with shelf divisions
• On Partitioning and Packing Products with Rectangles
• On Packing Splittable Items with Cardinality Constraints
• Approximation schemes for knapsack problems with shelf divisions
• Bin packing with divisible item sizes
• Automata, Languages and Programming
• Dynamic bin packing of unit fractions items
• Packing items into several bins facilitates approximating the separable assignment problem
• scientific article; zbMATH DE number 6842581
• The solution of packing problems with pieces variable length and additional allocation constraints

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Utilizing shelve slots: Sufficiency conditions for some easy instances of hard problems

Cited in

(1)

• Universal number partition problem with divisibility

This page was built for publication: PACKING SHELVES WITH ITEMS THAT DIVIDE THE SHELVES' LENGTH: A CASE OF A UNIVERSAL NUMBER PARTITION PROBLEM

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