Towards the real time solution of strike force asset allocation problems Academic Article

abstract

• The strike force asset allocation problem consists of grouping strike force assets into packages and assigning these packages to targets and defensive assets in a way that maximizes the strike force potential. Integer programming formulations are developed, semi-real and random problems are built up, and computational results via the CPLEX MIP Solver are presented. Scope and purpose. The strike force asset allocation problem consists of grouping strike force assets into packages and assigning these packages to targets and defensive assets in a way that maximizes the strike force potential. The problem is first formulated as an integer programming problem with multiple knapsack constraints and multiple choice constraints. This formulation can apply to many resource allocation problems. The problem is extended to incorporate defensive assets in the second formulation. Semi-real and random test problem sets are built up for the asset allocation problem with or without suppression and computational results are presented. 2003 Elsevier Ltd. All rights reserved.

authors

• Curry, Guy

published proceedings

• COMPUTERS & OPERATIONS RESEARCH

author list (cited authors)

• Li, V. C., Curry, G. L., & Boyd, E. A.

citation count

• 24

complete list of authors

• Li, VC||Curry, GL||Boyd, EA

publication date

• February 2004

publisher

• Elsevier  Publisher

published in

• Computers and Operations Research  Journal

keywords

• Multiple Choice Multidimensional Knapsack
• Resource Allocation
• Striking Asset Allocation

Digital Object Identifier (DOI)

• 10.1016/S0305-0548(02)00192-2

start page

• 273

end page

• 291

volume

• 31

issue

• 2

URL

• http://dx.doi.org/10.1016/s0305-0548(02)00192-2