Infractional knapsack fractionsof an item can be taken rather than having to make a binary choice for each of them. In this objective function is mathematically represented by: Max Where,Pi= profit and Xi = fraction. Where,Wi = weightof the corresponding andXi= fraction. ...
(1971), Transformation of Integer Programs to Knapsack Problems, Discrete Mathematics 1 (1), 29–45. MathSciNet MATH Google Scholar Bradley, S.P. and Frey, S.C. (1974), Fractional Programming with Homogeneous Functions, Operations Research 22, 350–357. MathSciNet MATH Google Scholar ...
Program. 37 (1987), 255–267. Ishii, H., Ibaraki, T., and Mine, H.: ‘Fractional knapsack problems’, Math. Program. 13 (1976), 255–271. CrossRef Iwano, K., Misono, S., Tezuka, S., and Fujishige, S.: ‘A new scaling algorithm for the maximum mean cut problem’, ...