Content deleted Content added
COPknowledge (talk | contribs) Expanded the problem definition to describe and explain two problem parameters and instance-specific cost parameters and how they relate to the MAP size. |
m ce |
||
Line 24:
The multidimensional assignment problem (MAP) has two key parameters that determine ''the size of a problem instance'':
# The '''[[dimension|dimensionality]] parameter''' <math>D</math>
# The '''[[
=== Size of cost array ===
Any problem instance of the MAP with parameters <math>D, N</math> has its specific '''cost array''' <math>C</math>, which consists of <math>N^{D}</math> instance-specific costs/weights parameters <math>C(a,a_1,\ldots,a_{D-1})</math>.
=== Number of feasible solutions ===
The [[feasible region|
== Computational complexity ==
Line 42:
*[[Data fusion|Multi-sensor data fusion]] <ref>{{Cite journal|last=Poore|first=Aubrey B.|date=1994|title=Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking|journal=Computational Optimization and Applications|volume=3|issue=1|pages=27-57|doi=10.1007/BF01299390}}</ref>
*[[Record linkage|Record linkage or multipartite entity resolution]] <ref name="Pasi21" />
*[[Particle physics|Elementary
*[[Medical alarm|Fall detection in elderly with small wearable devices]]
|