A study of network violator interception based on a reliable game model
From MaRDI portal
Publication:1717694
DOI10.1155/2014/124343zbMath1407.90074OpenAlexW1963514201WikidataQ59062944 ScholiaQ59062944MaRDI QIDQ1717694
Shi An, Jianxun Cui, Meng Zhao, Ji'an Wang
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/124343
Programming involving graphs or networks (90C35) Noncooperative games (91A10) Applications of game theory (91A80) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Cites Work
- Network interdiction via a critical disruption path: branch-and-price algorithms
- Network flow interdiction on planar graphs
- Robust minimum variance linear state estimators for multiple sensors with different failure rates
- Stochastic Network Interdiction
- Finding the K Shortest Loopless Paths in a Network
This page was built for publication: A study of network violator interception based on a reliable game model
