Bin packing with directed stackability conflicts

Abstract

The Bin Packing problem is a well-known and highly investigated problem in the computer science: we have n items given with their sizes, and we want to assign them to unit capacity bins such, that we use the minimum number of bins.

Keywords

• f.2.2
• 68r05
• bin packing problem
• conflicts
• directed conflicts
• hanoi conflicts
• unit size items
• dynamic programming