A computerized algorithm for the determination of the optimal allocation of two weapons systems against N targets.
computerizedalgo00amer.pdf (1.617Mb)Abstract
The problem of allocating munitions from M weapons systems
to N target complexes is studied and a review of pertinent
literature is presented. An algorithm for the solution of
the problem in the special case of two weapons systems
against N targets is developed and programmed for computerized
solution. The results of an example problem are shown and
tested. Discussion of the algorithm's extension to more
than two weapons systems is included as are alternative
solution techniques.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Dynamic platform-independent meta-algorithms for graph-partitioning
(Monterey, California. Naval Postgraduate School, 1998-09-01);A dynamic platform-independent solver is developed for use with network and graph algorithms of operations research. This solver allows analysts to solve a large variety of problems without writing code. Algorithms from a ... -
Multigrid preconditioners for the hybridised discontinuous Galerkin discretisation of the shallow water equations
(Elsevier, 2020-10-26);Numerical climate- and weather-prediction models require the fast solution of the equations of fluid dynamics. Discontinuous Galerkin (DG) discretisations have several advantageous properties. They can be used for arbitrary ... -
Static-task scheduling incorporating precedence constraints and deadlines in a heterogeneous-computing environment / Michael D Niedert
(Monterey, California. Naval Postgraduate School, 2000-06);Distributed systems have grown in popularity due to the rapid increase in networking of personal computers. A mixture of computers consisting of different architectures can be more powerful, reliable, and scalable than a ...
