{"id":{"repo_id":"nps","oai_identifier":"oai:calhoun.nps.edu:10945/18902"},"canonical_url":"https://search.dev.ndltd.org/etd/nps/oai:calhoun.nps.edu:10945/18902","repository":{"repo_id":"nps","name":"Naval Postgraduate School","base_url":"https://calhoun.nps.edu/server/oai/request"},"display":{"title":"A two-directional target optimization model.","abstract":"This paper presents an algorithm for computing the optimal target path for two aircraft traversing a target area from different directions. There are constraints on the maneuverability of each aircraft which prohibit it from attacking every target. The algorithm chooses a subset of targets whose destruction will yield maximum value to the attacking force. The basis of the algorithm is the branch and bound method, with upper bounds computed by dynamic programming. Several variations are considered, such as payload limit, an increased number of aircraft from each direction, and a three-directional attack. An example problem is solved using the basic model. A Fortran IV computer program is included. Computation time versus problem characteristics is discussed.","abstract_html":"This paper presents an algorithm for computing the optimal target path for two aircraft traversing a target area from different directions. There are constraints on the maneuverability of each aircraft which prohibit it from attacking every target. The algorithm chooses a subset of targets whose destruction will yield maximum value to the attacking force. The basis of the algorithm is the branch and bound method, with upper bounds computed by dynamic programming. Several variations are considered, such as payload limit, an increased number of aircraft from each direction, and a three-directional attack. An example problem is solved using the basic model. A Fortran IV computer program is included. Computation time versus problem characteristics is discussed.","abstract_has_math":false,"creators":["Hamelin, Gregory R."],"institution":"Monterey, California. Naval Postgraduate School","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Operations Research","school":null,"contributors":[],"advisors":["Howard, Gilbert T."],"committee_chairs":[],"committee_members":[],"year":1979,"date_issued":"1979","date_published":"1979","updated_at":"2026-07-27T20:26:38Z","subjects":[],"languages":["en_US"],"rights":["This 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."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10945/18902","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Howard, Gilbert T."]},{"key":"dc:contributor.department","label":"Department","values":["Operations Research"]},{"key":"dc:creator","label":"Author","values":["Hamelin, Gregory R."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["March 1979"]},{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2012-11-16T19:31:52Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2012-11-16T19:31:52Z"]},{"key":"dc:date.issued","label":"Date","values":["1979"]},{"key":"dc:publisher","label":"Institution","values":["Monterey, California. Naval Postgraduate School"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["This 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."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10945/18902"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This paper presents an algorithm for computing the optimal target path for two aircraft traversing a target area from different directions. There are constraints on the maneuverability of each aircraft which prohibit it from attacking every target. The algorithm chooses a subset of targets whose destruction will yield maximum value to the attacking force. The basis of the algorithm is the branch and bound method, with upper bounds computed by dynamic programming. Several variations are considered, such as payload limit, an increased number of aircraft from each direction, and a three-directional attack. An example problem is solved using the basic model. A Fortran IV computer program is included. Computation time versus problem characteristics is discussed."]},{"key":"dc:title","label":"Title","values":["A two-directional target optimization model."]}]}],"canonical_facts":{"dc:contributor.advisor":["Howard, Gilbert T."],"dc:contributor.department":["Operations Research"],"dc:creator":["Hamelin, Gregory R."],"dc:date":["March 1979"],"dc:date.accessioned":["2012-11-16T19:31:52Z"],"dc:date.available":["2012-11-16T19:31:52Z"],"dc:date.issued":["1979"],"dc:description.abstract":["This paper presents an algorithm for computing the optimal target path for two aircraft traversing a target area from different directions. There are constraints on the maneuverability of each aircraft which prohibit it from attacking every target. The algorithm chooses a subset of targets whose destruction will yield maximum value to the attacking force. The basis of the algorithm is the branch and bound method, with upper bounds computed by dynamic programming. Several variations are considered, such as payload limit, an increased number of aircraft from each direction, and a three-directional attack. An example problem is solved using the basic model. A Fortran IV computer program is included. Computation time versus problem characteristics is discussed."],"dc:identifier.uri":["https://hdl.handle.net/10945/18902"],"dc:language.iso":["en_US"],"dc:publisher":["Monterey, California. Naval Postgraduate School"],"dc:rights":["This 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:title":["A two-directional target optimization model."],"dc:type":["Thesis"]},"updated_at":"2026-07-27T20:26:38Z"}