An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem
- Title
- An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem
- Author
- 강맹규
- Issue Date
- 2004-12
- Publisher
- PALGRAVE PUBLISHERS LTD
- Citation
- The Journal of the Operational Research Society v..55, No.5, Page.547-552
- Abstract
- An unbounded knapsack problem (KP) was investigated that describes the loading of items into a knapsack with a finite capacity, An unbounded knapsack problem (KP) was investigated that describes the loading of items into a knapsack with a finite capacity, W so as to maximize the total value of the loaded items. There were so as to maximize the total value of the loaded items. There were n types of an infinite number of items, each type with a distinct weight and value. Exact branch and bound algorithms have been successfully applied previously to the unbounded KP, even when types of an infinite number of items, each type with a distinct weight and value. Exact branch and bound algorithms have been successfully applied previously to the unbounded KP, even when n and W were very large; however, the algorithms are not adequate when the weight and the value of the items are strongly correlated. An improved branching strategy is proposed that is less sensitive to such a correlation; it can therefore be used for both strongly correlated and uncorrelated problems.
- URI
- https://www.proquest.com/docview/231383146?accountid=11283https://repository.hanyang.ac.kr/handle/20.500.11754/154167
- ISSN
- 0160-5682
- DOI
- 10.1057/palgrave.jors.2601698
- Appears in Collections:
- COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > INDUSTRIAL AND MANAGEMENT ENGINEERING(산업경영공학과) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML