A Study on the Class Constrained Bin Packing Problem
博士 === 國立臺灣科技大學 === 資訊管理系 === 102 === The Bin Packing Problem (BPP) has been one of the fundamental problems of combinatorial optimization since it was first proposed. It has received extensive attention from researchers because of its wide range of applications and its significant economic value....
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/37441620501041339947 |