| dc.contributor.advisor | 姚興台 | zh_TW |
| dc.contributor.advisor | YAO, XING-TAI | en_US |
| dc.contributor.author (Authors) | 莊照明 | zh_TW |
| dc.contributor.author (Authors) | HUANG, ZHAO-MING | en_US |
| dc.creator (作者) | 莊照明 | zh_TW |
| dc.creator (作者) | HUANG, ZHAO-MING | en_US |
| dc.date (日期) | 1985 | en_US |
| dc.date.accessioned | 5-May-2016 15:55:34 (UTC+8) | - |
| dc.date.available | 5-May-2016 15:55:34 (UTC+8) | - |
| dc.date.issued (上傳時間) | 5-May-2016 15:55:34 (UTC+8) | - |
| dc.identifier (Other Identifiers) | B2002006699 | en_US |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/91729 | - |
| dc.description (描述) | 碩士 | zh_TW |
| dc.description (描述) | 國立政治大學 | zh_TW |
| dc.description (描述) | 統計學系 | zh_TW |
| dc.description.abstract (摘要) | 背包問題是整數規劃中一個特殊的模式，雖然它可以運用一般整數規劃法則來處理， | zh_TW |
| dc.source.uri (資料來源) | http://thesis.lib.nccu.edu.tw/record/#B2002006699 | en_US |
| dc.subject (關鍵詞) | 背包問題 | zh_TW |
| dc.subject (關鍵詞) | 整數規劃 | zh_TW |
| dc.subject (關鍵詞) | 規劃 | zh_TW |
| dc.subject (關鍵詞) | 限縮背包問題 | zh_TW |
| dc.subject (關鍵詞) | KNAPSACK-PROBLEM | en_US |
| dc.subject (關鍵詞) | COLLAPSING-KANPSACK-PROBLEM | en_US |
| dc.title (題名) | 背包問題(KNAPSACK PROBLEM)之研究 | zh_TW |
| dc.type (資料類型) | thesis | en_US |
