An Effective Algorithm for Multi-dimensional Knapsack Problem
碩士 === 國立交通大學 === 資訊管理研究所 === 85 === Knapsack Problem is a well-known problem in Operation Research. However, Knapsack Problem is a NP-hard problem . If we solve Knapsack Problem by Exhaustive Enumeration , a problem with 60 items will ne...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1997
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/67297470780458953380 |