Title of article
A polynomial-time algorithm for knapsack with divisible item sizes
Author/Authors
W. F. J. Verhaegh، نويسنده , , E. H. L. Aarts، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1997
Pages
5
From page
217
To page
221
Keywords
Combinatorial problems , computational complexity , Algorithms , Knapsack
Journal title
Information Processing Letters
Serial Year
1997
Journal title
Information Processing Letters
Record number
128690
Link To Document