A polynomial-time algorithm for knapsack with divisible item sizes

Information Processing Letters

Volumn 62, Issue 4, 1997, Pages 217-221

  Verhaegh, W F J ^a   Aarts, E H L ^a,b  

^a PHILIPS RESEARCH LABORATORIES   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Algorithms; Combinatorial problems; Computational complexity; Knapsack

Indexed keywords

EID: 0043043782     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00061-6     Document Type: Article

References (4)

1. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, New Yoric, 1979).
2. O. Marcotte, The cutting stock problem and integer rounding, Math. Programming 33 (1985) 82-92.
3. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations (John Wiley & Sons, New York, 1990).
4. Y. Pochet and L.A. Wolsey, Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation, Discrete Appl. Math. 59 (1995) 57-74.