Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAndersen, Alexandre Colaers-
dc.contributor.authorPavlikov, Konstantin-
dc.contributor.authorToffolo, Túlio Ângelo Machado-
dc.identifier.citationANDERSEN, A. C.; PAVLIKOV, K.; TOFFOLO, T. A. M. Weapon-target assignment problem: exact and approximate solution algorithms. Annals of Operations Research, v. 312, p. 581-606, 2022. Disponível em: <>. Acesso em: 06 jul. 2022.pt_BR
dc.description.abstractThe Weapon-Target Assignment (WTA) problem aims to assign a set of weapons to a number of assets (targets), such that the expected value of survived targets is minimized. The WTA problem is a nonlinear combinatorial optimization problem known to be NP-hard. This paper applies several existing techniques to linearize the WTA problem. One linearization technique (Camm et al. in Oper Res 50(6):946–955, 2002) approximates the nonlinear terms of the WTA problem via convex piecewise linear functions and provides heuristic solutions to the WTA problem. Such approximation problems are, though, relatively easy to solve from the computational point of view even for large-scale problem instances. Another approach proposed by O’Hanley et al. (Eur J Oper Res 230(1):63–75, 2013) linearizes theWTA problem exactly at the expense of incorporating a significant number of additional variables and constraints, which makes many large-scale problem instances intractable. Motivated by the results of computational experiments with these existing solution approaches, a specialized new exact solution approach is developed, which is called branch-and-adjust. The proposed solution approach involves the compact piecewise linear convex under-approximation of the WTA objective function and solves the WTA problem exactly. The algorithm builds on top of any existing branch-and-cut or branch-and-bound algorithm and can be implemented using the tools provided by state-of-the-art mixed integer linear programming solvers. Numerical experiments demonstrate that the proposed specialized algorithm is capable of handling very large scale problem instances with up to 1500 weapons and 1000 targets, obtaining solutions with optimality gaps of up to 2.0% within 2 h of computational runtime.pt_BR
dc.subjectInteger programmingpt_BR
dc.subjectProbability chainspt_BR
dc.titleWeapon-target assignment problem : exact and approximate solution algorithms.pt_BR
dc.typeArtigo publicado em periodicopt_BR
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
  Restricted Access
602,3 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.