A hybrid genetic algorithm for the large-scale 0-1 multidimensional knapsack problem
碩士 === 國立清華大學 === 工業工程與工程管理學系 === 94 === The 0-1 multidimensional knapsack problem (0-1 MKP) is the problem of finding a subset of items that yields maximum profit under several knapsack constraints. It belongs to the class of NP-hard problems. When the dimension increases, the computing time needed...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/26435724904248142452 |