On different approximation criteria for subset product problems
From MaRDI portal
Recommendations
Cites work
- Approximate Algorithms for the 0/1 Knapsack Problem
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 3723844 (Why is no real title available?)
- scientific article; zbMATH DE number 3737033 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Non deterministic polynomial optimization problems and their approximations
- Toward a unified approach for the classification of NP-complete optimization problems
Cited in
(5)- Heuristic methods and applications: A categorized survey
- Bi-criteria path problem with minimum length and maximum survival probability
- Assessing the effect of multiple cost changes using reverse set tolerances
- Approximate solution of NP optimization problems
- ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
This page was built for publication: On different approximation criteria for subset product problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1076608)