Revision as of 14:49, 28 September 2003 edit Onebyone (talk \| contribs) Extended confirmed users 1,923 edits Clean up the formal definition, remove links which were either 404, irrelevant, or way above the simple assignment problem. ← Previous edit		Revision as of 15:00, 28 September 2003 edit undo Onebyone (talk \| contribs) Extended confirmed users 1,923 edits Article is now FOLDC-free, remove the citation. Next edit →
Line 15: An '''assignment problem''' (or '''linear assignment''') gives two sets, ''A'' and ''T'', of equal size, together with a cost function ''C'' which maps pairs (''a'',''t'') (where ''a'' lies in ''A'' and ''t'' in ''T'') to [[real number]]s. The problem then is to find the [[bijection]] ''Pf'' from ''A'' to ''T'' such that the sum of ''C''(''a'',''Pf''(''a'')) across all ''a'' in ''A'' is minimized. The problem is "linear" because the cost function to be optimized as well as all the constraints can be expressed as linear equations. ~~----~~ ~~''This article was originally based on material from [[FOLDOC]], used with [[Public Domain Resources/Foldoc license\|permission]]. Update as needed.''~~

Assignment problem: Difference between revisions