A Study on Approximation Algorithm for Multi-dimensional Knapsack Problem

• Main Authors: CHANG, JUI-SHENG, 張睿昇
• Other Authors: CHANG, JEN-CHUN
• Format: Others
• Language: en_US
• Published: 2018
• Online Access: http://ndltd.ncl.edu.tw/handle/n5a4fb

碩士 === 國立臺北大學 === 資訊工程學系 === 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-KP for d > 1 unless P=NP, for here which d means the dimension of knapsack problem. We design an approximation algorithm for d-KP based on the Hopfield networks. Experimental results show that our proposed algorithm performs better than a well-known greedy algorithm in many cases.