산업경영시스템학회지 (Journal of Korean Society of Industrial and Systems Engineering)
- 제19권40호
- /
- Pages.137-142
- /
- 1996
- /
- 2005-0461(pISSN)
- /
- 2287-7975(eISSN)
선수제약 선형배낭문제의 해법연구
An Algorithm for a Cardinality Constrained Linear Programming Knapsack Problem
초록
An algorithm for solving the cardinality constrained linear programming knapsack problem is presented. The algorithm has a convenient structure for a branch-and-bound approach to the integer version, especially to the 0-1 collapsing knapsack problem. A numerical example is given.
키워드