An experimental comparison of some heuristics for cardinality constrained bin packing problem
Background: Bin packing is an NPhard optimization problem of packing items of given sizes into minimum number of capacitylimited bins. Besides the basic problem, numerous other variants of bin packing exist. The cardinality constrained bin packing adds an additional constraint that the number of ite...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2012-01-01
|
| Series: | Business Systems Research |
| Subjects: | |
| Online Access: | http://www.degruyter.com/view/j/bsrj.2012.3.issue-2/v10305-012-0013-1/v10305-012-0013-1.xml?format=INT |