A Note on Approximation Schemes for Multidimensional Knapsack Problems
From MaRDI portal
Recommendations
- An approximate dynamic programming approach to multidimensional knapsack problems
- Approximation for knapsack problems with multiple constraints
- Approximation for multi-knapsack problem
- A Fast Approximation Scheme for the Multiple Knapsack Problem
- Parameterized approximation scheme for the multiple knapsack problem
- Parameterized approximation scheme for the multiple knapsack problem
- Approximability of two variants of multiple knapsack problems
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- scientific article; zbMATH DE number 1418266
- Approximating multiobjective knapsack problems
Cited in
(33)- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Distributed approximation of k-service assignment
- scientific article; zbMATH DE number 3850828 (Why is no real title available?)
- An FPTAS for the -modular multidimensional knapsack problem
- An optimization framework for solving large scale multidemand multidimensional knapsack problem instances employing a novel core identification heuristic
- Vanishing price of decentralization in large coordinative nonconvex optimization
- Vector bin packing with multiple-choice
- Shrinking maxima, decreasing costs: new online packing and covering problems
- Capacity allocation problem with random demands for the rail container carrier
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- A faster FPTAS for knapsack problem with cardinality constraint
- A faster FPTAS for knapsack problem with cardinality constraint
- scientific article; zbMATH DE number 1617338 (Why is no real title available?)
- Approximating multidimensional subset sum and Minkowski decomposition of polygons
- Hardness of approximation for knapsack problems
- Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- The fractional multidimensional knapsack problem: solution and uniqueness
- A PTAS for the square tiling problem
- On the computational complexity of reliability redundancy allocation in a series system
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- An improved binary search algorithm for the multiple-choice knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- A solution procedure for general knapsack problems with a few constraints
- There is no EPTAS for two-dimensional knapsack
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Approximation for knapsack problems with multiple constraints
- Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
- A Fast Approximation Scheme for the Multiple Knapsack Problem
- scientific article; zbMATH DE number 4031399 (Why is no real title available?)
This page was built for publication: A Note on Approximation Schemes for Multidimensional Knapsack Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718485)
