Approximate algorithms for some generalized knapsack problems
From MaRDI portal
(Redirected from Publication:1238705)
Cites work
- Approximate Algorithms for the 0/1 Knapsack Problem
- Approximation algorithms for combinatorial problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 3427118 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3299758 (Why is no real title available?)
- Storage cost considerations in secondary index selection
Cited in
(15)- Polynomial time approximation schemes for class-constrained packing problems
- The multidimensional 0-1 knapsack problem: an overview.
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
- Heuristic methods and applications: A categorized survey
- Approximation for knapsack problems with multiple constraints
- A 4.31-approximation for the geometric unique coverage problem on unit disks
- Approximation schemes for \(r\)-weighted minimization knapsack problems
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- APPLICATION PLACEMENT ON A CLUSTER OF SERVERS
- Vector bin packing with multiple-choice
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
This page was built for publication: Approximate algorithms for some generalized knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1238705)
