ISSN : 2005-0461(Print)
ISSN : 2287-7975(Online)
ISSN : 2287-7975(Online)
선수제약 선형배낭문제의 해법연구
An Algorithm for a Cardinality Constrained Linear Programming Knapsack Problem
Abstract
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.
- SOGOBO_1996_v19n40_137.pdf218.7KB