Knapsack Problems Revisited
碩士 === 國立臺灣科技大學 === 工業管理系 === 99 === The Knapsack Problems family is one of the most important problems in Optimization fields.It was classified into NP-hard problem.Unbounded Knapsack Problem is one variant that has special properties can be efficiently exploited.In this thesis, we first give a qui...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/12390272395432700575 |