Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)
- Volume 15 Issue 2
- /
- Pages.33-44
- /
- 1990
- /
- 1225-1119(pISSN)
- /
- 2733-4759(eISSN)
An Efficient Algorithm for the Generalized Multiple Choice Linear Knapsack Problem
일반 다중선택 선형배낭문제에 대한 효율적인 해법
Abstract
An efficient algorithm is developed for the linear programming relaxation of generalized multiple choice knaspack problem. The generalized multiple choice knaspack problem is an extension of the multiple choice knaspack problem whose relaxed LP problem has been studied extensively. In the worst case, the computational coimplexity of the proposed algorithm is of order 0(n.
Keywords