Live briefing
Everything about Generalized assignment problem
Combinatorial optimization problem
In applied mathematics, the maximum generalized assignment problem is a problem in combinatorial optimization. This problem is a generalization of the assignment problem in which both tasks and agents have a size. Moreover, the size of each task might vary from one agent to the other. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Generalized assignment problemA 5-minute orientation
- Skim a recent paper: An efficient adaptive large neighborhood search algorithm based on heuristics and reformulations for the generalized quadratic assignment problemInfluential work since 2022
- Pick up a classic book: Optical Illusions in RomeThe most-reprinted book on the subject
- Read the landmark paper: An approximation algorithm for the generalized assignment problemCited 538 times
- Go sideways: David ShmoysA closely related topic
- Go sideways: List of knapsack problemsA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
An approximation algorithm for the generalized assignment problem
A survey of algorithms for the generalized assignment problem
An efficient approximation for the Generalized Assignment Problem
Tabu search for the multilevel generalized assignment problem
Bees algorithm for generalized assignment problem
An Ejection Chain Approach for the Generalized Assignment Problem
A Tabu search heuristic for the generalized assignment problem
Algorithms for the Multi-Resource Generalized Assignment Problem
🆕 Influential since 2022
An efficient adaptive large neighborhood search algorithm based on heuristics and reformulations for the generalized quadratic assignment problem
Solving the reliability-oriented generalized assignment problem by Lagrangian relaxation and Alternating Direction Method of Multipliers
A genetic engineering algorithm for the generalized quadratic assignment problem
Online generalized assignment problem with historical information
A Simulated Annealing Algorithm for the Generalized Quadratic Assignment Problem
📚 Books worth reading
- 📕Optical Illusions in RomeKirsti Andersen · 2020
- 📕Advances in non-Archimedean analysisInternational Conference on p-Adic Functional Analysis (11th 2010 Université Blaise Pascal) · 2011
Algebraic And Combinatorial Aspects Of Tropical Geometry Ciem Workshop On Tropical Geometry December 1216 2011 International Center For Mathematical Meetings Castro Urdiales SpainCIEM Workshop · 2013- 📕Advances in non-Archimedean analysisGermany) International Conference on p-adic Functional Analysis (13th 2014 Paderborn · 2016
Advances In Ultrametric Analysis 12th International Conference On Padic Functional Analysis July 26 2012 University Of Manitoba Winnipeg CanadaInternational Conference · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- David Shmoys David Bernard Shmoys (born 1959) is a Professor in the School of Operations Research and Information Engineering and the Department of Computer Science…
- List of knapsack problems The knapsack problem is one of the most studied problems in combinatorial optimization, with many real-life applications. For this reason, many special…
- Weapon-target assignment problem The weapon-target assignment (WTA) problem is a class of combinatorial optimization problems present in the fields of optimization and operations research…
- Quadratic knapsack problem The quadratic knapsack problem (QKP), first introduced in 19th century, is an extension of knapsack problem that allows for quadratic terms in the objective…
- Karmarkar–Karp bin packing algorithms The Karmarkar–Karp (KK) bin packing algorithms are several related approximation algorithm for the bin packing problem. The bin packing problem is a problem…
- Maximum coverage problem The maximum coverage problem is a classical question in computer science, computational complexity theory, and operations research. It is a problem that…
- Grothendieck inequality In mathematics, the Grothendieck inequality states that there is a universal constant K G {\displaystyle K_{G}} with the following property. If Mij is…
- Submodular set function In mathematics, a submodular set function (also known as a submodular function) is a set function that, informally, describes the relationship between…