(A) study on algorithm for the multiconstraint 0-1 knapsack problem다수 제약식을 갖는 0-1 배낭문제의 해법에 관한 연구
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Kim, Se-Hun | - |
| dc.contributor.advisor | 김세헌 | - |
| dc.contributor.author | Kim, Seong-Lyun | - |
| dc.contributor.author | 김성륜 | - |
| dc.date.accessioned | 2011-12-14T06:04:43Z | - |
| dc.date.available | 2011-12-14T06:04:43Z | - |
| dc.date.issued | 1990 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=67498&flag=dissertation | - |
| dc.identifier.uri | http://hdl.handle.net/10203/44869 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 경영과학과, 1990.2, [ [ii], 47, [1] p. ] | - |
| dc.description.abstract | The Multiconstraint 0-1 Knapsack Problem(MCKP) is encountered when one has to decide how to make efficient use of an entity which consumes multiple resources. Unlike the single constraint version of this problem, the MCKP has been seldom addressed in spite of its wide applicability. In this study, the algorithm for the MCKP to optimality is discussed. Main emphasis is on the efficient problem reduction methods which fix as many variables as possible prior to the implicit enumeration phase with small computational burden. The computational results related to the each section are reported. | eng |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.title | (A) study on algorithm for the multiconstraint 0-1 knapsack problem | - |
| dc.title.alternative | 다수 제약식을 갖는 0-1 배낭문제의 해법에 관한 연구 | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 67498/325007 | - |
| dc.description.department | 한국과학기술원 : 경영과학과, | - |
| dc.identifier.uid | 000881061 | - |
| dc.contributor.localauthor | Kim, Se-Hun | - |
| dc.contributor.localauthor | 김세헌 | - |
- Appears in Collection
- MG-Theses_Master(석사논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.