Integer Prim-Read Solutions to a Class of Target Defense Problems

Stefan A. Burr, James E. Falk and Alan F. Karr
Additional contact information
Stefan A. Burr: City University of New York, New York, New York
James E. Falk: The George Washington University, Washington, D.C.
Alan F. Karr: The Johns Hopkins University, Baltimore, Maryland

Operations Research, 1985, vol. 33, issue 4, 726-745

Abstract: We study the choice of a deployment and firing doctrine for defending separated point targets of (potentially) different values against an attack by an unknown number of sequentially arriving missiles. We minimize the total number of defenders, subject to an upper bound on the maximum expected value damage per attacking weapon. We show that the Greedy Algorithm produces an optimal integral solution to this problem.

Keywords: 456 defense of point targets; 625 nonlinear integer problems; 630 exact solution by greedy algorithm (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.4.726 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:33:y:1985:i:4:p:726-745

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().