Universal number partition problem with divisibility

DOI10.1016/j.disc.2012.01.022zbMath1242.05017OpenAlexW2161373473MaRDI QIDQ418873

J. Herrera, H. S. Yoon

Publication date: 30 May 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.01.022

zbMATH Keywords

packingFrobenius probleminteger partitions

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Utilizing shelve slots: Sufficiency conditions for some easy instances of hard problems
• Complexity of the Frobenius problem
• PACKING SHELVES WITH ITEMS THAT DIVIDE THE SHELVES' LENGTH: A CASE OF A UNIVERSAL NUMBER PARTITION PROBLEM
• Two-Processor Scheduling with Start-Times and Deadlines
• Unnamed Item
• Unnamed Item

This page was built for publication: Universal number partition problem with divisibility