A polynomial time approximation scheme for the multiple knapsack problem
From MaRDI portal
Recommendations
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- scientific article; zbMATH DE number 1445306
- Approximation for knapsack problems with multiple constraints
- Parameterized approximation scheme for the multiple knapsack problem
- A Fast Approximation Scheme for the Multiple Knapsack Problem
Cited in
(45)- A successive approximation algorithm for the multiple knapsack problem
- On the multiperiod binary knapsack problem
- Upper bounds and algorithms for the maximum cardinality bin packing problem.
- On maximizing the throughput of multiprocessor tasks.
- Optimizing a mail-order with discount and shipping costs
- A PTAS for the multiple subset sum problem with different knapsack capacities
- Online algorithms with advice for the dual bin packing problem
- Knapsack with variable weights satisfying linear constraints
- Approximation for multi-knapsack problem
- Approximation for knapsack problems with multiple constraints
- Scheduling multiple two-stage flowshops with a deadline
- Approximation issues of fractional knapsack with penalties: a note
- Scheduling on multiple two-stage flowshops with a deadline
- On the approximability of the two-phase knapsack problem
- Some new results on multi-dimension Knapsack problem
- A fast asymptotic approximation scheme for bin packing with rejection
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
- A Fast Approximation Scheme for the Multiple Knapsack Problem
- A deterministic polynomial-time approximation scheme for counting knapsack solutions
- Approximate truthful mechanism design for two-dimensional orthogonal knapsack problem
- Approximate composable truthful mechanism design
- Parameterized approximation scheme for the multiple knapsack problem
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
- scientific article; zbMATH DE number 3900493 (Why is no real title available?)
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- Coordinated scheduling of production and delivery with production window and delivery capacity constraints
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
- A new fully polynomial approximation scheme for the knapsack problem
- A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem
- scientific article; zbMATH DE number 6861894 (Why is no real title available?)
- scientific article; zbMATH DE number 1445306 (Why is no real title available?)
- A simple PTAS for the dual bin packing problem and advice complexity of its online version
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- Approximation algorithms for scheduling with reservations
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines
- Local-search based heuristics for advertisement scheduling
- An optimal algorithm for online multiple knapsack
- Approximating the geometric knapsack problem in near-linear time and dynamically
- An EPTAS for cardinality constrained multiple knapsack via iterative randomized rounding
- Semi-definite relaxation algorithm of multiple knapsack problem
- Note on polynomial-time approximation schemes for integrated network design and scheduling problems
- Improved approximation algorithms for the multiple two-stage knapsack problem
- A polynomial algorithm for the multiple knapsack problem with divisible item sizes
This page was built for publication: A polynomial time 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 Q4941826)
