Revision as of 16:28, 17 February 2022 edit Felix QW (talk \| contribs) Extended confirmed users 8,596 edits m →Formal definition: ce Tag: 2017 wikitext editor ← Previous edit		Revision as of 16:36, 17 February 2022 edit undo Felix QW (talk \| contribs) Extended confirmed users 8,596 edits Added cite Tag: 2017 wikitext editor Next edit →
Line 12: 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\|last=Natu\|first=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\|issn=0167-8191}}</ref> ==Formal definition==

Multidimensional assignment problem: Difference between revisions