Multidimensional assignment problem: Difference between revisions

Revision as of 22:40, 29 January 2023

Revision as of 23:07, 11 February 2023

Line 1:

{{Short description|Generalization of linear assignment problem from two to multiple dimensions}}

The '''multidimensional assignment problem''' (MAP) is a fundamental [[combinatorial optimization]] problem which was introduced by [[William Pierskalla]].<ref name="Pier68">{{cite journal |last=Pierskalla |first=William P. |title=Letter to the Editor—The Multidimensional Assignment Problem | journal=Operations Research |publisher=INFORMS |date=1968 |volume=16 |issue=2 |pages=422–431 |doi=10.1287/opre.16.2.422 |url=https://pubsonline.informs.org/doi/abs/10.1287/opre.16.2.422|doi-access=free }}</ref> This problem can be seen as a generalization of the linear [[assignment problem]].<ref name="Pasi21">{{Cite arXiv|last1=Kammerdiner|first1=Alla|last2=Semenov|first2=Alexander|last3=Pasiliao|first3=Eduardo |date=2021|title=Multidimensional Assignment Problem for multipartite entity resolution|class=cs.DM |eprint=2112.03346}}</ref> In words, the problem can be described as follows:

: An instance of the problem has a number of ''agents'' (i.e., ''cardinality'' parameter) and a number of ''job characteristics'' (i.e., ''dimensionality'' parameter) such as task, machine, time interval, etc. For example, an agent can be assigned to perform task X, on machine Y, during time interval Z. Any agent can be assigned to perform a job with any combination of unique job characteristics at some ''cost''. These costs may vary based on the assignment of agent to a combination of job characteristics - specific task, machine, time interval, etc. The problem is to minimize the ''total cost'' of assigning the agents so that the assignment of agents to each job characteristic is an [[injective function]], or [[one-to-one function]] from agents to a given job characteristic.

Alternatively, describing the problem using graph theory:

:The multidimensional assignment problem consists of finding, in a [[weighted graph|weighted]] [[multipartite graph]], a [[Matching (graph theory)|matching]] of a given size, in which the sum of weights of the edges is minimum.<ref>{{Cite journal|last1=Natu|first1=Shardul|last2=Date|first2=Ketan|last3=Nagi|first3=Rakesh|date=2020|title=GPU-accelerated Lagrangian heuristic for multidimensional assignment problems with decomposable costs|url=http://dx.doi.org/10.1016/j.parco.2020.102666|journal=Parallel Computing|volume=97|pages=102666|doi=10.1016/j.parco.2020.102666|s2cid=221667518 |issn=0167-8191|doi-access=free}}</ref>

==Formal definition==