Weapon target assignment problem: Difference between revisions

Revision as of 13:54, 20 September 2013

Revision as of 15:54, 20 September 2013

Line 26:

== Algorithms and generalizations ==

It has long been known that assignment problems are [[NP-hard]]{{citation needed|date=September 2013}}. Nonetheless, 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==