Approximation for knapsack problems with multiple constraints
From MaRDI portal
Recommendations
- Approximation for multi-knapsack problem
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- scientific article; zbMATH DE number 1418266
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
Cites work
- `` Strong NP-Completeness Results
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- Approximate algorithms for some generalized knapsack problems
- Approximate Algorithms for the 0/1 Knapsack Problem
- Approximation for multi-knapsack problem
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 3644795 (Why is no real title available?)
Cited in
(23)- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- A successive approximation algorithm for the multiple knapsack problem
- Approximation algorithms for knapsack problems with cardinality constraints
- Knapsack with variable weights satisfying linear constraints
- Approximation for multi-knapsack problem
- Multi-constrained matroidal knapsack problems
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Approximating the product knapsack problem
- Hardness of approximation for knapsack problems
- Knapsack problem with objective value gaps
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
- A Fast Approximation Scheme for the Multiple Knapsack Problem
- Approximability of two variants of multiple knapsack problems
- A Further Generalized Kettele Algorithm with Multiple Constraints
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- scientific article; zbMATH DE number 2097195 (Why is no real title available?)
- scientific article; zbMATH DE number 1418266 (Why is no real title available?)
- An addendum to: ``Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
- A fully polynomial approximation scheme for a knapsack problem with a minimum filling constraint (extended abstract)
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- Approximated consistency for knapsack constraints
- Approximating single- and multi-objective nonlinear sum and product knapsack problems
- Approximate formulations for 0-1 knapsack sets
This page was built for publication: Approximation for knapsack problems with multiple constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964357)
