Approximation algorithms for knapsack problems with cardinality constraints
type: Item
instance of: scholarly article
title: Approximation algorithms for knapsack problems with cardinality constraints
zbMATH Open document ID: 0961.90131
DOI: 10.1016/S0377-2217(99)00261-1
author: Alberto Caprara
author: Hans Kellerer
author: Ulrich Pferschy
author: David Pisinger
published in: European Journal of Operational Research
publication date: 2000-07-09T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1471185
zbMATH Keywords: packing
zbMATH Keywords: approximation algorithms
zbMATH Keywords: dynamic programming
zbMATH Keywords: knapsack problem
Wikidata QID: Q58826485
describes a project that uses: Knapsack
MaRDI profile type: Publication
cites work: Time bounds for selection
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: A new linear storage, polynomial-time approximation scheme for the subset-sum problem
cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
cites work: Q3888846
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: A new fully polynomial time approximation scheme for the Knapsack problem
cites work: Q4370212
cites work: Q3320130
cites work: Fast Approximation Algorithms for Knapsack Problems
cites work: A fully polynomial approximation algorithm for the 0-1 knapsack problem
cites work: Heuristic algorithms for the multiple knapsack problem
cites work: Linear time algorithms for some separable quadratic programming problems
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Simple but efficient approaches for the collapsing knapsack problem
cites work: A fast algorithm for strongly correlated knapsack problems
cites work: Q4247440
cites work: The Collapsing 0–1 Knapsack Problem
cites work: Approximate Algorithms for the 0/1 Knapsack Problem
cites work: Computational study of a column generation algorithm for bin packing and cutting stock problems
Recommended article: Approximation for knapsack problems with multiple constraints
Recommended article: Constant-Time Approximation Algorithms for the Knapsack Problem
Recommended article: Approximation schemes for the parametric knapsack problem
Recommended article: Approximation Algorithms for the Weight-Reducible Knapsack Problem
Recommended article: Approximate and exact algorithms for the fixed-charge knapsack problem
Recommended article: Q5475207
Recommended article: Approximation algorithms for the multiple knapsack problem with assignment restrictions
Recommended article: Q3538766
Recommended article: Approximation algorithms for a two-phase knapsack problem
Recommended article: Approximation Algorithms for Matroid and Knapsack Means Problems
description: scientific article; zbMATH DE number 1471185