Bin Packing and Bin Covering of Subsets
博士 === 國立交通大學 === 資訊管理研究所 === 104 === Bin packing and bin covering are two of the most commonly arising computational tasks in resource allocation. Both problems aim to partition a set of items abiding by some constraints to achieve specific objectives. This work provides a unifying framework to dea...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/76209328907620997913 |