Note--On "An Efficient Algorithm for the 0-1 Knapsack Problem, by Robert M. Nauss"

D. Fayard and G. Plateau
Additional contact information
D. Fayard: Institut Universitaire de Technologie, Orsay, France
G. Plateau: Universite des Sciences et Techniques, Lille, France

Management Science, 1978, vol. 24, issue 9, 918-919

Abstract: In this paper, Robert M. Nauss [Nauss, R. M. 1976. An efficient algorithm for the 0-1 knapsack problem. Management Sci. 23 (1, September) 27-31.] presents an algorithm for the 0-1 knapsack problem--denoted by Algorithm A--about which we would like to provide several remarks.

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.24.9.918 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:24:y:1978:i:9:p:918-919

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().