| dc.contributor | 企管系 | en_US |
| dc.creator (作者) | 唐揆 | zh_TW |
| dc.creator (作者) | Huang, Ping H. ; Tang, Kwei | en_US |
| dc.date (日期) | 2012-09 | en_US |
| dc.date.accessioned | 14-Nov-2013 11:54:33 (UTC+8) | - |
| dc.date.available | 14-Nov-2013 11:54:33 (UTC+8) | - |
| dc.date.issued (上傳時間) | 14-Nov-2013 11:54:33 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/61684 | - |
| dc.description.abstract (摘要) | A classic bound for periodicity was defined by Kellerer et al. (2004) [5] in their comprehensive book on knapsack problems. We propose an almost-tight bound which improves on the classic bound in all instances. | en_US |
| dc.format.extent | 194209 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Operations Research Letters, 40(5) , 329-331 | en_US |
| dc.subject (關鍵詞) | Combinatorial optimization; Integer programming; Knapsack problem; Periodicity | en_US |
| dc.title (題名) | A Constructive Periodicity Bound for the Unbounded Knapsack Problem | en_US |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1016/j.orl.2012.05.001 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/http://dx.doi.org/10.1016/j.orl.2012.05.001 | en_US |
