Approximation algorithms for knapsack problems with cardinality constraints
- 1 June 2000
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 123 (2) , 333-345
- https://doi.org/10.1016/s0377-2217(99)00261-1
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Fast approximation algorithms for knapsack type problemsPublished by Springer Nature ,2005
- A New Fully Polynomial Time Approximation Scheme for the Knapsack ProblemJournal of Combinatorial Optimization, 1999
- An efficient approximation scheme for the subset-sum problemPublished by Springer Nature ,1997
- Fixed-Parameter Tractability and Completeness I: Basic ResultsSIAM Journal on Computing, 1995
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- A new linear storage, polynomial-time approximation scheme for the subset-sum problemDiscrete Applied Mathematics, 1990
- Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analysesEuropean Journal of Operational Research, 1984
- ON THE EXISTENCE OF FAST APPROXIMATION SCHEMES11Supported by Sonderforschungsbereich 21 (DFG), Institut für Operations Research, Universität Bonn.Published by Elsevier ,1981
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- Time bounds for selectionJournal of Computer and System Sciences, 1973