Revision as of 02:34, 11 June 2011 edit Rjpbi (talk \| contribs) 19 edits No edit summary ← Previous edit		Revision as of 02:35, 11 June 2011 edit undo Rjpbi (talk \| contribs) 19 edits No edit summary Next edit →
Line 26: == Algorithms and generalizations == It has long been known that assignment problems are [[NP-hard]]. Nonetheless, an exact solution can be found using [[branch and bound]] techniques which utilize [[relaxation (approximation})]]. Many heuristic algorithms have been proposed which provide near-optimal solutions in [[polynomial time]] <ref>Ahuja, R. et al. Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem. Operations Research 55(6), pp. 1136–1146, 2007</ref>. ==Example==

Weapon target assignment problem: Difference between revisions