Approximation algorithms for knapsack problems with cardinality constraints
From MaRDI portal
Recommendations
- Approximation for knapsack problems with multiple constraints
- Constant-time approximation algorithms for the knapsack problem
- Approximation schemes for the parametric knapsack problem
- Approximation algorithms for the weight-reducible knapsack problem
- Approximate and exact algorithms for the fixed-charge knapsack problem
- A new approximation algorithm for the knapsack problem
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- A new approximate algorithm for the knapsack problem
- Approximation algorithms for a two-phase knapsack problem
- Approximation Algorithms for Matroid and Knapsack Means Problems
Cites work
- A fast algorithm for strongly correlated knapsack problems
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- A new fully polynomial time approximation scheme for the Knapsack problem
- A new linear storage, polynomial-time approximation scheme for the subset-sum problem
- Approximate Algorithms for the 0/1 Knapsack Problem
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Heuristic algorithms for the multiple knapsack problem
- scientific article; zbMATH DE number 3850828 (Why is no real title available?)
- scientific article; zbMATH DE number 3694944 (Why is no real title available?)
- scientific article; zbMATH DE number 1302173 (Why is no real title available?)
- scientific article; zbMATH DE number 1104339 (Why is no real title available?)
- Linear time algorithms for some separable quadratic programming problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Simple but efficient approaches for the collapsing knapsack problem
- The Collapsing 0–1 Knapsack Problem
- Time bounds for selection
Cited in
(70)- Modified subset sum heuristics for bin packing
- Polynomial time approximation schemes for class-constrained packing problems
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- A polyhedral study of the cardinality constrained knapsack problem
- Randomized strategies for cardinality robustness in the knapsack problem
- A new exact approach for the 0-1 collapsing knapsack problem
- An approximation algorithm for a competitive facility location problem with network effects
- Network pollution games
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
- Computing knapsack solutions with cardinality robustness
- Two-dimensional knapsack-block packing problem
- Approximate \#knapsack computations to count semi-fair allocations
- An FPTAS for the -modular multidimensional knapsack problem
- Robust online algorithms for dynamic choosing problems
- Multistage knapsack
- A new class of hard problem instances for the 0-1 knapsack problem
- Approximation schemes for \(r\)-weighted minimization knapsack problems
- Offline black and white bin packing
- On the complexity of working set selection
- Approximation and online algorithms for multidimensional bin packing: a survey
- On approximating the incremental knapsack problem
- Bin packing with general cost structures
- Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
- Greedy algorithm for the general multidimensional knapsack problem
- An efficient algorithm for the collapsing knapsack problem
- Hybrid rounding techniques for knapsack problems
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Truthful approximation mechanisms for restricted combinatorial auctions
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- Integer knapsack problems with set-up weights
- Product sequencing and pricing under cascade browse model
- New results for network pollution games
- The Subset Sum game
- Exact solution of the robust knapsack problem
- Minimum and worst-case performance ratios of rollout algorithms
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- Committee selection under weight constraints
- scientific article; zbMATH DE number 1839478 (Why is no real title available?)
- Reductions between scheduling problems with non-renewable resources and knapsack problems
- scientific article; zbMATH DE number 1408349 (Why is no real title available?)
- On the proximity of the optimal values of the multi-dimensional knapsack problem with and without the cardinality constraint
- scientific article; zbMATH DE number 7366679 (Why is no real title available?)
- Optimal genetic screening for cystic fibrosis
- A new effective dynamic program for an investment optimization problem
- Multistage knapsack
- Order acceptance and scheduling with consideration of service level
- Approximation Algorithms for a Bi-level Knapsack Problem
- Approximation algorithms for the weight-reducible knapsack problem
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
- Bounding the running time of algorithms for scheduling and packing problems
- A faster FPTAS for knapsack problem with cardinality constraint
- Tight bounds for online class-constrained packing
- A faster FPTAS for knapsack problem with cardinality constraint
- Reoptimizing the 0-1 knapsack problem
- Randomized strategies for robust combinatorial optimization with approximate separation
- Bag-of-tasks scheduling with rejection in large computing systems
- Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing
- An FPTAS for budgeted laminar matroid independent set
- Scheduling with cardinality dependent unavailability periods
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
- Coordinated order scheduling and outsourcing on dedicated parallel machines
- Lower bounds for matroid optimization problems with a linear constraint
- Minimal cost reconfiguration of data placement in a storage area network
- An EPTAS for cardinality constrained multiple knapsack via iterative randomized rounding
- A nonparametric robust optimization approach for chance-constrained knapsack problem
- There is no EPTAS for two-dimensional knapsack
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Approximation schemes for knapsack problems with shelf divisions
- L-class enumeration algorithms for a discrete production planning problem with interval resource quantities
This page was built for publication: Approximation algorithms for knapsack problems with cardinality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569936)
