An efficient approximation for the generalized assignment problem
From MaRDI portal
Publication:845859
DOI10.1016/j.ipl.2006.06.003zbMath1185.68853MaRDI QIDQ845859
Danny Raz, Reuven Cohen, Liran Katzir
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.003
68W25: Approximation algorithms
Related Items
A Novel Approximate Algorithm for Admission Control, The generalized assignment problem with minimum quantities, The equilibrium generalized assignment problem and genetic algorithm, Distributed approximation of cellular coverage, Improved approximation algorithms for box contact representations, The generalized maximum coverage problem, Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization, Task assignment in tree-like hierarchical structures, Approximability of Two Variants of Multiple Knapsack Problems, Two stage decision making approach for Sensor Mission Assignment Problem, Tight Approximation Bounds for the Seminar Assignment Problem, A Polynomial Time Approximation Scheme for the Square Packing Problem, On Lagrangian Relaxation and Subset Selection Problems
Uses Software
Cites Work
- An approximation algorithm for the generalized assignment problem
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- Tight approximation algorithms for maximum general assignment problems
- Fast Approximation Algorithms for Knapsack Problems
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A unified approach to approximating resource allocation and scheduling
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
