Using covering and resource allocation models to decision support in rescue actions and crisis management
Journal Title: Computer Science and Mathematical Modelling - Year 2008, Vol 0, Issue 2
Abstract
In the paper an application of methods for determining flows in networks to military forces maneuver planning is presented. Model of formal network as environment model for manoeuvre planning based on digital maps is defined. Optimization problem of redeployment planning of K objects from source region to destination one taking into account paths disjointness is considered. The method for finding one of the acceptable solution of considered redeployment problem based on method of solving maximum flow problem is described. The method for finding optimal solution of considered problem based on method of solving minimum cost network flow problem in some substitute network is defined. For both of the methods computational complexity is estimated. Some computational examples of presented methods are shown.
Authors and Affiliations
Zbigniew Tarapata
Keywords
Related Articles
- EP ID EP63083
- DOI -
- Views 133
- Downloads 0
Badanie wydajności wybranych środowisk budowy platformy integracyjnej
W artykule przedstawiono sposób badania wydajności platformy integracyjnej utworzonej przy wykorzystaniu różnych środowisk. Artykuł zawiera opis metryk wydajności platformy integracyjnej. Analizie poddano także zakres na...
Using Montgomery curve arithmetic over F2p for point scalar multiplication on short Weierstrass curve over Fp with exactly one 2-torsion point and order not divisible by 4
Montgomery curves are well known because of their efficiency and side channel attacks vulnerability. In this article it is showed how Montgomery curve arithmetic may be used for point scalar multiplication on short Weier...
Mathematical aspects of objects' spiderweb modelling
In this paper opportunities to use so called spiderweb modeling method in modeling and qualitative analysis of complex objects in the processes of data exploration were discussed. Such terms as N-dimension spiderweb s...
Economical assigning weapons to targets
Some upper and lower bound are proposed to use in branch and bound method for solving Weapon-Target Assignment (WTA) problems. Analyze of WTA inspires to formulate another problem to economize the number of weapons unde...
Constructing unitary matrices for quantum decision algorithm
Thesis includes description of decision algorithm and a proposal of its quantum implementation. The algorithm is based on four steps, which lead to construct matrix form of quantum operator solving given decision task. T...