Content deleted Content added
Ethmostigmus (talk | contribs) m Formatted references, added Template:More citations needed |
Citation bot (talk | contribs) Add: url, issue, volume. | Use this bot. Report bugs. | Suggested by Abductive | Category:Matching (graph theory) | #UCB_Category 25/48 |
||
Line 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 |volume=312 |issue=2 |pages=581–606 |doi=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 |first1=Ravindra K. |last2=Kumar |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 |pages=1136–1146 |doi=10.1287/opre.1070.0440}}</ref>
==Example==
| |||