Show simple item record

dc.contributor.authorHoward, Gilbert T.
dc.dateApril 1972
dc.date.accessioned2017-04-06T14:46:09Z
dc.date.available2017-04-06T14:46:09Z
dc.date.issued1972-04
dc.identifier.urihttp://hdl.handle.net/10945/52526
dc.description.abstractWe consider the problem of a defender guarding a boundary from attack by a fixed number of invaders who are approaching the boundary. His objective is to intercept the maximum number of invaders before they cross the boundary. The defender is not required to remain on the boundary but he must investigate the contacts in first-come first-served order, Weights may also be assigned to each invader to reflect the value to the defender of intercepting that invader. A dynamic programming formulation is given. The multiple defender problem is also considered, and several other generalizations are discussed. Examples are included.en_US
dc.description.sponsorshipNaval Analysis Programs (Code 462), Office of Naval Research Arlington, Viriginia 2217en_US
dc.publisherMonterey, California. Naval Postgraduate School
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
dc.titleMinimizing the number of penetrations in a boundary defense problem (U)en_US
dc.typeTechnical Report
dc.contributor.departmentOperations Research and Administrative Sciencesen_US
dc.subject.authorBoundary Defense
dc.subject.authorInvestigation Theory
dc.subject.authorTraveling Salesman
dc.subject.authorDynamic Programming Application
dc.description.funderP.O. 1-0192en_US
dc.identifier.npsreportNPS 55HK72041Aen_US
dc.description.distributionstatementApproved for public release; distribution is unlimited.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record