Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

The multi-divisional linear knapsack problem

다분할(多分割) 선형배낭문제(線型背囊問題)

  • 원중연 (경기대학교 산업공학과) ;
  • 정성진 (서울대학교 산업공학과)
  • Published : 1991.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

The multi-divisional knapsack problem is defined as a binary knapsack problem where each of mutually exclusive divisions has its own capacity. We consider the relaxed LP problem and develop a transformation which converts the multi-divisional linear knapsack problem into smaller size linear knapsack problems. Solution procedures and a numerical example are presented.

Keywords