Weapon target assignment problem: Difference between revisions

Revision as of 14:18, 4 February 2022

Latest revision as of 00:07, 30 April 2024

(3 intermediate revisions by 3 users not shown)

Line 1:

{{More citations needed|date=April 2024}}

The '''weapon target assignment problem''' ('''WTA''') is a class of [[combinatorial optimization]] problems present in the fields of [[Optimization (mathematics)|optimization]] and [[operations research]]. It consists of finding an optimal assignment of a set of [[weapon]]s of various types to a set of targets in order to maximize the total expected damage done to the opponent.

Line 28 ⟶ 29:

== Algorithms and generalizations ==

An exact solution can be found using [[branch and bound]] techniques which utilize [[relaxation (approximation)]].<ref>{{cite journal |last1=Andersen, |first1=A.C., |last2=Pavlikov, |first2=K. & |last3=Toffolo, |first3=T.A.M. |year=2022 |title=Weapon-Target Assignment Problem: Exact and Approximate Solution Algorithms. |journal=Annals of Operations Research (2022).|volume=312 https://|issue=2 |pages=581–606 |doi.org/=10.1007/s10479-022-04525-6|url=https://findresearcher.sdu.dk/ws/files/204132463/WTA.pdf }}</ref>. Many [[heuristic algorithm]]s have been proposed which provide near-optimal solutions in [[polynomial time]].<ref>{{cite journal |last1=Ahuja, R|first1=Ravindra K. et|last2=Kumar al|first2=Arvind |last3=Jha |first3=Krishna C. |last4=Orlin |first4=James B. |year=2007 |title=Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem. |journal=Operations Research |volume=55( |issue=6), pp. |pages=1136–1146, 2007|doi=10.1287/opre.1070.0440}}</ref>

==Example==

Line 68 ⟶ 69:

[[Category:Combinatorial optimization]]

[[Category:Matching (graph theory)]]

[[Category:Combat modeling]]