Revision as of 03:27, 30 July 2015 edit Aby4reality (talk \| contribs) 1 edit Fixed typo Tags: canned edit summary Mobile edit Mobile web edit ← Previous edit		Revision as of 19:47, 6 January 2017 edit undo Mauricio360 (talk \| contribs) 25 edits →Algorithms and generalizations: The very same "assignment problem" linked in this article is polynomial. Next edit →
Line 28: == Algorithms and generalizations == ~~It has long been known that assignment problems are [[NP-hard]]{{citation needed\|date=September 2013}}. Nonetheless, an~~An exact solution can be found using [[branch and bound]] techniques which utilize [[relaxation (approximation)]]. Many [[heuristic 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