1991Journal of the Operational Research SocietyRequires access

Knapsack Problems: Algorithms and Computer Implementations

David Connolly, Silvano Martello, Paolo Toth

Open publisher page 3,161 citations

Abstract

Introduction knapsack problem bounded knapsack problem subset-sum problem change-making problem multiple knapsack problem generalized assignment problem bin packing problem. Appendix: computer codes.

About this research paper

What this paper is about

Introduction knapsack problem bounded knapsack problem subset-sum problem change-making problem multiple knapsack problem generalized assignment problem bin packing problem. Appendix: computer codes.

Why it matters

OpenAlex reports 3161 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Introduction knapsack problem bounded knapsack problem subset-sum problem change-making problem multiple knapsack problem generalized assignment problem bin packing problem. Appendix: computer codes.

Key concepts: Knapsack problem, Implementation, Computer science, Algorithm, Information technology, Information system, Operations research, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Knapsack Problems: Algorithms and Computer Implementations — Research Paper | ScholarLens