Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

An Algorithm for a Cardinality Constrained Linear Programming Knapsack Problem

선수제약 선형배낭문제의 해법연구

  • 원중연 (경기대학교 산업공학과)
  • Published : 1996.12.01
Download PDF
⟨ Previous Next ⟩

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.

Keywords