Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

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

Published Online:1 May 1978https://doi.org/10.1287/mnsc.24.9.918

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.

Previous
Back to Top
Next
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.
Agree