A polynomial-time algorithm for knapsack with divisible item sizes

W.F.J. Verhaegh, E.H.L. Aarts

Research output: Contribution to journalArticleScientificpeer-review

Original languageEnglish
Pages (from-to)217-221
Number of pages5
JournalInformation Processing Letters
Volume62
Issue number4
DOIs
Publication statusPublished - 1997
Externally publishedYes

Cite this

@article{5aae786af4094a3799730abad5cd0b5c,
title = "A polynomial-time algorithm for knapsack with divisible item sizes",
author = "W.F.J. Verhaegh and E.H.L. Aarts",
year = "1997",
doi = "10.1016/S0020-0190(97)00061-6",
language = "English",
volume = "62",
pages = "217--221",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "4",

}

A polynomial-time algorithm for knapsack with divisible item sizes. / Verhaegh, W.F.J.; Aarts, E.H.L.

In: Information Processing Letters, Vol. 62, No. 4, 1997, p. 217-221.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - A polynomial-time algorithm for knapsack with divisible item sizes

AU - Verhaegh, W.F.J.

AU - Aarts, E.H.L.

PY - 1997

Y1 - 1997

U2 - 10.1016/S0020-0190(97)00061-6

DO - 10.1016/S0020-0190(97)00061-6

M3 - Article

VL - 62

SP - 217

EP - 221

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 4

ER -