Discrete resource allocation problems and military applications
The paper deals with the discrete resource allocation problem and its application in the attack steering systems. The non-linear models of multiple target prioritisation are presented in the case of multiple different weapons. The fast greedy algorithms are presented and investigated. In the case o...
Saved in:
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Vilnius University Press
2002-12-01
|
Series: | Lietuvos Matematikos Rinkinys |
Online Access: | https://www.zurnalai.vu.lt/LMR/article/view/32910 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1825197220696162304 |
---|---|
author | Vytautas Tiešis |
author_facet | Vytautas Tiešis |
author_sort | Vytautas Tiešis |
collection | DOAJ |
description |
The paper deals with the discrete resource allocation problem and its application in the attack steering systems. The non-linear models of multiple target prioritisation are presented in the case of multiple different weapons. The fast greedy algorithms are presented and investigated. In the case of homogeneous resources (weapons) the algorithms give optimal solutions. The experiments show that the algorithms give sufficiently exact solutions in the case of different weapons.
|
format | Article |
id | doaj-art-1d17f061de904a6ba0d1f4e4cc38e347 |
institution | Kabale University |
issn | 0132-2818 2335-898X |
language | English |
publishDate | 2002-12-01 |
publisher | Vilnius University Press |
record_format | Article |
series | Lietuvos Matematikos Rinkinys |
spelling | doaj-art-1d17f061de904a6ba0d1f4e4cc38e3472025-02-11T18:13:41ZengVilnius University PressLietuvos Matematikos Rinkinys0132-28182335-898X2002-12-0142spec.10.15388/LMR.2002.32910Discrete resource allocation problems and military applicationsVytautas Tiešis0Institute of Mathematics and Informatics The paper deals with the discrete resource allocation problem and its application in the attack steering systems. The non-linear models of multiple target prioritisation are presented in the case of multiple different weapons. The fast greedy algorithms are presented and investigated. In the case of homogeneous resources (weapons) the algorithms give optimal solutions. The experiments show that the algorithms give sufficiently exact solutions in the case of different weapons. https://www.zurnalai.vu.lt/LMR/article/view/32910 |
spellingShingle | Vytautas Tiešis Discrete resource allocation problems and military applications Lietuvos Matematikos Rinkinys |
title | Discrete resource allocation problems and military applications |
title_full | Discrete resource allocation problems and military applications |
title_fullStr | Discrete resource allocation problems and military applications |
title_full_unstemmed | Discrete resource allocation problems and military applications |
title_short | Discrete resource allocation problems and military applications |
title_sort | discrete resource allocation problems and military applications |
url | https://www.zurnalai.vu.lt/LMR/article/view/32910 |
work_keys_str_mv | AT vytautastiesis discreteresourceallocationproblemsandmilitaryapplications |