A discrete multilevel attack-defense model with nonhomogeneous opponent resources

DOI10.1007/S10598-018-9396-3zbMath1405.90026OpenAlexW2790991670MaRDI QIDQ1797695

I. E. Yanochkin, A. G. Perevozchikov, V. Yu. Reshetov

Publication date: 22 October 2018

Published in: Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10598-018-9396-3

zbMATH Keywords

minimax defense strategybest guaranteed defense outcomediscrete analogue of Germeier's equalization principleinteger and nonhomogeneous opponent resourcesmultilevel attack-defense modeltarget allocation by classical transportation problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Transportation, logistics and supply chain management (90B06)

Related Items (2)

Generalized target-allocation functions and their evaluation by the branch-and-bound method ⋮ A dynamic probabilistic model of two-sided combat

Cites Work

• A model of overpowering a multilevel defense system by attack
• Differential properties of the maximum function under connected constraints
• Approximate reduction of the problem of determining a maximin to the problem of determining a maximum by means of penalty functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A discrete multilevel attack-defense model with nonhomogeneous opponent resources