1985•ACM Transactions on Mathematical SoftwareOpen access

Algorithm 632: A program for the 0–1 multiple knapsack problem

Silvano Martello, Paolo Toth

Abstract

article Free AccessArtifacts AvailableArtifacts Evaluated & ReusableAlgorithm 632: A program for the 0–1 multiple knapsack problem Authors: Silvano Martello DEIS, University of Bologna, Viale Risorgimento 2, Bologne, Italy DEIS, University of Bologna, Viale Risorgimento 2, Bologne, ItalyView Profile , Paolo Toth University of Florence University of FlorenceView Profile Authors Info & Claims ACM Transactions on Mathematical SoftwareVolume 11Issue 2pp 135–140https://doi.org/10.1145/214392.214397Published:01 June 1985Publication History 15citation1,386DownloadsMetricsTotal Citations15Total Downloads1,386Last 12 Months38Last 6 weeks8 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 25 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

Key concepts: Knapsack problem, Citation, Computer science, Algorithm, World Wide Web