Revision as of 11:50, 13 February 2022 edit Felix QW (talk \| contribs) Extended confirmed users 8,596 edits Plenty of sources to be found. Tag: 2017 wikitext editor ← Previous edit		Revision as of 13:33, 13 February 2022 edit undo Felix QW (talk \| contribs) Extended confirmed users 8,596 edits →Computational complexity: Add cite Tag: 2017 wikitext editor Next edit →
Line 22: == Computational complexity == The problem is generally [[NP-hard]]. In other words, there is no known [[algorithm]] for solving this problem in polynomial time, and so a long computational time may be needed for solving problem instances of even moderate size (based on dimensionality and cardinality parameters).{{Cite journal\|last=Nguyen\|first=Duc Manh\|last2=Le Thi\|first2=Hoai An\|last3=Pham Dinh\|first3=Tao\|date=2012-10-12\|title=Solving the Multidimensional Assignment Problem by a Cross-Entropy method\|journal=Journal of Combinatorial Optimization\|volume=27\|issue=4\|pages=808–823\|doi=10.1007/s10878-012-9554-z\|issn=1382-6905}} [[User:Felix QW\|Felix QW]] ([[User talk:Felix QW\|talk]]) 11:49, 13 February 2022 (UTC) == References ==

Multidimensional assignment problem: Difference between revisions