An efficient approximation for the generalized assignment problem
From MaRDI portal
Publication:845859
DOI10.1016/J.IPL.2006.06.003zbMATH Open1185.68853OpenAlexW2158760370MaRDI QIDQ845859FDOQ845859
Authors: Reuven Cohen, Liran Katzir, Danny Raz 
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
Recommendations
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- A class of greedy algorithms for the generalized assignment problem
- Publication:4952619
- An approximation algorithm for the generalized assignment problem
- Solving the generalized assignment problem: an optimizing and heuristic approach
Cites Work
- Title not available (Why is that?)
- An approximation algorithm for the generalized assignment problem
- Fast Approximation Algorithms for Knapsack Problems
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Title not available (Why is that?)
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Title not available (Why is that?)
- A unified approach to approximating resource allocation and scheduling
- Title not available (Why is that?)
- Tight approximation algorithms for maximum general assignment problems
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- Title not available (Why is that?)
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
Cited In (51)
- Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems
- Title not available (Why is that?)
- The generalized assignment problem with minimum quantities
- A reduction approach to the repeated assignment problem
- The generalized maximum coverage problem
- Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\)
- A note on exact algorithms for the bottleneck generalized assignment problem
- Solving the weighted capacitated planned maintenance problem and its variants
- A path relinking approach with ejection chains for the generalized assignment problem
- Distributed approximation of \(k\)-service assignment
- A Novel Approximate Algorithm for Admission Control
- Constrained submodular maximization via a nonsymmetric technique
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
- The generalized assignment problem: Valid inequalities and facets
- Coupled and k-Sided Placements: Generalizing Generalized Assignment
- R \& D planning and the generalized assignment problem
- Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization
- The equilibrium generalized assignment problem and genetic algorithm
- A hybrid algorithm for the generalized assignment problem
- An approximation algorithm for the generalized assignment problem
- Distributed approximation of cellular coverage
- Performance bounds with curvature for batched greedy optimization
- A constant factor approximation for the generalized assignment problem with minimum quantities and unit size items
- Tight Approximation Bounds for the Seminar Assignment Problem
- On Lagrangian Relaxation and Subset Selection Problems
- A Survey of the Generalized Assignment Problem and Its Applications
- Technical note -- The multinomial logit model with sequential offerings: algorithmic frameworks for product recommendation displays
- Two stage decision making approach for sensor mission assignment problem
- Maximum generalized assignment with convex costs
- On Lagrangian relaxation for constrained maximization and reoptimization problems
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS
- A simple dual algorithm for the generalised assignment problem
- Approximation algorithms for the partial assignment problem
- Tight approximation algorithms for maximum separable assignment problems
- Flexible allocation on related machines with assignment restrictions
- A priority based unbalanced time minimization assignment problem
- Submodular optimization problems and greedy strategies: a survey
- Approximability of two variants of multiple knapsack problems
- A polynomial-time approximation scheme for the airplane refueling problem
- Approximation algorithms for the generalized incremental knapsack problem
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
- Task assignment in tree-like hierarchical structures
- A Polynomial Time Approximation Scheme for the Square Packing Problem
- A class of greedy algorithms for the generalized assignment problem
- Generalized assignment of time-sensitive item groups
- A new extended formulation of the generalized assignment problem and some associated valid inequalities
- Online submodular maximization with preemption
- Reducing the elastic generalized assignment problem to the standard generalized assignment problem
- Improved approximation algorithms for box contact representations
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
Uses Software
This page was built for publication: An efficient approximation for the generalized assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845859)
