Parameterized approximation scheme for the multiple knapsack problem
From MaRDI portal
Recommendations
Cited in
(34)- A successive approximation algorithm for the multiple knapsack problem
- Parameterized approximation via fidelity preserving transformations
- Minimum cost partitions of trees with supply and demand
- An almost optimal approximation algorithm for monotone submodular multiple knapsack
- Scheduling multiple two-stage flowshops with a deadline
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Scheduling on multiple two-stage flowshops with a deadline
- On the approximability of the two-phase knapsack problem
- Stochastic budget optimization in internet advertising
- Approximation and online algorithms for multidimensional bin packing: a survey
- Knapsack problems: a parameterized point of view
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
- A Fast Approximation Scheme for the Multiple Knapsack Problem
- Approximability of two variants of multiple knapsack problems
- Approximate truthful mechanism design for two-dimensional orthogonal knapsack problem
- Approximate composable truthful mechanism design
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- Parametric Solution for Linear Bicriteria Knapsack Models
- A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem
- Packing groups of items into multiple knapsacks
- Packing groups of items into multiple knapsacks
- Parameterized approximation scheme for the multiple knapsack problem
- scientific article; zbMATH DE number 2097195 (Why is no real title available?)
- scientific article; zbMATH DE number 1418266 (Why is no real title available?)
- scientific article; zbMATH DE number 1445306 (Why is no real title available?)
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem
- Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints
- Improved approximation for two-dimensional vector multiple knapsack
- Approximating the geometric knapsack problem in near-linear time and dynamically
- An EPTAS for cardinality constrained multiple knapsack via iterative randomized rounding
- Improved approximation for two-dimensional vector multiple knapsack
- Improved approximation algorithms for the multiple two-stage knapsack problem
This page was built for publication: Parameterized approximation scheme for the multiple knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586185)
