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

  • 제17권1호
  • /
  • Pages.127-130
  • /
  • 1991
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

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

The multi-divisional linear knapsack problem

  • 원중연 (경기대학교 산업공학과) ;
  • 정성진 (서울대학교 산업공학과)
  • 발행 : 1991.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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.

키워드