scientific article; zbMATH DE number 1445306
From MaRDI portal
Publication:4952619
Recommendations
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- scientific article; zbMATH DE number 1418266
- Parameterized approximation scheme for the multiple knapsack problem
- Parameterized approximation scheme for the multiple knapsack problem
- A Fast Approximation Scheme for the Multiple Knapsack Problem
Cited in
(45)- Bandwidth-constrained allocation in grid computing
- Geometric quadrisection in linear time, with application to VLSI placement
- Polynomial time approximation schemes for class-constrained packing problems
- Upper bounds and algorithms for the maximum cardinality bin packing problem.
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- A PTAS for the multiple subset sum problem with different knapsack capacities
- A PTAS for the time-invariant incremental knapsack problem
- Mathematical models and decomposition methods for the multiple knapsack problem
- Approximation for multi-knapsack problem
- The multiple multidimensional knapsack with family-split penalties
- An FPTAS for the -modular multidimensional knapsack problem
- Multistage knapsack
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- On the approximability of the two-phase knapsack problem
- Improved approximation algorithms for a bilevel knapsack problem
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- A new upper bound for the multiple knapsack problem
- The multiple subset sum problem
- A basic parameterized complexity primer
- Approximability of two variants of multiple knapsack problems
- Spectrum Bidding in Wireless Networks and Related
- Parameterized approximation scheme for the multiple knapsack problem
- Distributed approximation of cellular coverage
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- Packing groups of items into multiple knapsacks
- Packing groups of items into multiple knapsacks
- Parameterized approximation scheme for the multiple knapsack problem
- Confronting intractability via parameters
- scientific article; zbMATH DE number 1418266 (Why is no real title available?)
- Improved approximation algorithms for box contact representations
- Maximizing expected utility for stochastic combinatorial optimization problems
- A branch-and-bound algorithm for hard multiple knapsack problems
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- Robustly assigning unstable items
- Approximation algorithms for drone delivery scheduling with a fixed number of drones
- A decomposition approach for multidimensional knapsacks with family‐split penalties
- The price of fairness for budget-feasible EF1 allocations
- Scheduling with bully selfish jobs
- Semi-definite relaxation algorithm of multiple knapsack problem
- The subset assignment problem for data placement in caches
- Packing resizable items with application to video delivery over wireless networks
- Approximation schemes for knapsack problems with shelf divisions
- An efficient approximation for the generalized assignment problem
- Coupled and \(k\)-sided placements: generalizing generalized assignment
- A PTAS for the chance-constrained knapsack problem with random item sizes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952619)
