Weapon target assignment problem: Difference between revisions

Revision as of 14:18, 4 February 2022

Revision as of 08:41, 7 March 2022

Line 28:

== Algorithms and generalizations ==

An exact solution can be found using [[branch and bound]] techniques which utilize [[relaxation (approximation)]].<ref>Andersen, A.C., Pavlikov, K. & Toffolo, T.A.M. Weapon-Target Assignment Problem: Exact and Approximate Solution Algorithms. Annals of Operations Research (2022). https://doi.org/10.1007/s10479-022-04525-6</ref>. 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==