Revision as of 21:54, 7 September 2013 edit Mark viking (talk \| contribs) Extended confirmed users 19,326 edits Added wl ← Previous edit		Revision as of 21:54, 7 September 2013 edit undo Mark viking (talk \| contribs) Extended confirmed users 19,326 edits →Algorithms and generalizations: Added wl 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~~algorithm]]s 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