Approximate algorithms for some generalized knapsack problems
From MaRDI portal
Publication:1238705
DOI10.1016/0304-3975(76)90048-7zbMATH Open0359.90053OpenAlexW2024427769MaRDI QIDQ1238705FDOQ1238705
Authors: K. Appert
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
Cites Work
- Approximation algorithms for combinatorial problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Title not available (Why is that?)
- Approximate Algorithms for the 0/1 Knapsack Problem
- Storage cost considerations in secondary index selection
Cited In (15)
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
- APPLICATION PLACEMENT ON A CLUSTER OF SERVERS
- Vector bin packing with multiple-choice
- A 4.31-approximation for the geometric unique coverage problem on unit disks
- Heuristic methods and applications: A categorized survey
- Polynomial time approximation schemes for class-constrained packing problems
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
- The multidimensional 0-1 knapsack problem: an overview.
- Approximation schemes for \(r\)-weighted minimization knapsack problems
- Approximation for knapsack problems with multiple constraints
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
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)