article · Computing · 1980

Dynamic programming algorithms for the Zero-One Knapsack Problem

Cited by 151Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Toth, P. (1980). Dynamic programming algorithms for the Zero-One Knapsack Problem. Computing, 25(1), 29–45. https://doi.org/10.1007/bf02243880

MLA 9

Toth, P. “Dynamic programming algorithms for the Zero-One Knapsack Problem.” Computing, vol. 25, no. 1, 1980, pp. 29–45, https://doi.org/10.1007/bf02243880.

Chicago

Toth, P. 1980. “Dynamic programming algorithms for the Zero-One Knapsack Problem.” Computing 25 (1): 29–45. https://doi.org/10.1007/bf02243880.

Harvard

Toth, P. (1980) ‘Dynamic programming algorithms for the Zero-One Knapsack Problem’, Computing, 25(1), pp. 29–45. Available at: https://doi.org/10.1007/bf02243880.

BibTeX

@article{toth1980dynamic,
  title = {{Dynamic programming algorithms for the Zero-One Knapsack Problem}},
  author = {Toth, P.},
  journal = {Computing},
  volume = {25},
  number = {1},
  pages = {29--45},
  year = {1980},
  doi = {10.1007/bf02243880}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.