Approximate algorithms for some generalized knapsack problems
From MaRDI portal
Publication:1238705
DOI10.1016/0304-3975(76)90048-7zbMath0359.90053OpenAlexW2024427769MaRDI QIDQ1238705
Publication date: 1977
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(76)90048-7
Related Items
Solving the linear multiple choice knapsack problem with two objectives: Profit and equity, Polynomial time approximation schemes for class-constrained packing problems, A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares, Vector bin packing with multiple-choice, Approximation for knapsack problems with multiple constraints, The multidimensional 0-1 knapsack problem: an overview., Approximation schemes for deal splitting and covering integer programs with multiplicity constraints, A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, A 4.31-approximation for the geometric unique coverage problem on unit disks, APPLICATION PLACEMENT ON A CLUSTER OF SERVERS, Approximation schemes for \(r\)-weighted minimization knapsack problems, Heuristic methods and applications: A categorized survey, 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
Cites Work
