A Study on Approximation Algorithm for Multi-dimensional Knapsack Problem
碩士 === 國立臺北大學 === 資訊工程學系 === 106 === In this thesis, we study the d-dimensional knapsack problem (d-KP). The problem d-KP is an generalized problem of the well-known knapsack problem which is an NP-complete problem. It is also known that there is no fully polynomial-time approximation scheme for d-K...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/n5a4fb |