On the PTAS complexity of multidimensional knapsack
From MaRDI portal
Cites work
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- A new fully polynomial time approximation scheme for the Knapsack problem
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- An ant colony optimization approach for the multidimensional knapsack problem
- Approximate algorithms for some generalized knapsack problems
- Approximate Algorithms for the 0/1 Knapsack Problem
- Approximating Knapsack and partition via dense subset sums
- Approximation algorithms for knapsack problems with cardinality constraints
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Bounding the running time of algorithms for scheduling and packing problems
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Heuristics for the 0-1 multidimensional knapsack problem
- scientific article; zbMATH DE number 3850828 (Why is no real title available?)
- scientific article; zbMATH DE number 3495588 (Why is no real title available?)
- scientific article; zbMATH DE number 7561569 (Why is no real title available?)
- scientific article; zbMATH DE number 7204473 (Why is no real title available?)
- scientific article; zbMATH DE number 7122316 (Why is no real title available?)
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Introduction to algorithms.
- On Multidimensional Packing Problems
- On problems as hard as CNF-SAT
- On problems equivalent to \((\min,+)\)-convolution
- On the complexity of k-SAT
- On the Solution of Discrete Programming Problems
- Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
- Parameterized complexity of fair bisection: (FPT-approximation meets unbreakability)
- Reducibility among combinatorial problems
- SETH-based Lower Bounds for Subset Sum and Bicriteria Path
- The design of approximation algorithms
- The multidimensional 0-1 knapsack problem: an overview.
- There is no EPTAS for two-dimensional knapsack
This page was built for publication: On the PTAS complexity of multidimensional knapsack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445572)