2000•European Journal of Operational ResearchRequires access

Approximation algorithms for knapsack problems with cardinality constraints

Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger

Open publisher page 190 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 190 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.

Key concepts: Knapsack problem, Polynomial-time approximation scheme, Continuous knapsack problem, Mathematics, Cardinality (data modeling), Cutting stock problem, Approximation algorithm, Change-making problem

Back to paper search Browse research topics Original source

Approximation algorithms for knapsack problems with cardinality constraints — Research Paper | ScholarLens