한국경영과학회지 (Journal of the Korean Operations Research and Management Science Society)

  • 제17권2호
  • /
  • Pages.117-122
  • /
  • 1992
  • /
  • 1225-1119(pISSN)
  • /
  • 2733-4759(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

Notes on Reducing Mixed Integer Knapsack Problems

  • Lee, Ho-Chang (Department of Business Administration, Kyung Hee University)
  • 발행 : 1992.08.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

We consider 0-1 mixed integer knapsack problems. They turn out to be no more difficult to solve than the corresponding 0-1 pure integer knapsack problems with efficient pseudopolynomial time algorithm.

키워드