Notes on Reducing Mixed Integer Knapsack Problems

  • Lee, Ho-Chang (Department of Business Administration, Kyung Hee University)
  • Published : 1992.08.01

Abstract

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.

Keywords