2012
DOI: 10.1007/978-1-4614-5278-2_4
|View full text |Cite
|
Sign up to set email alerts
|

Interdiction Models and Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
9
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(9 citation statements)
references
References 44 publications
0
9
0
Order By: Relevance
“…Models that explicitly take into account the strategic nature of the adversary lead to game theory models, which include network interdiction problems, [12], and patrolling games over networks, [2]. In particular, in [24], the authors determine the optimal patroling strategy on a border by considering a zero sum simultaneous game over a line network.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Models that explicitly take into account the strategic nature of the adversary lead to game theory models, which include network interdiction problems, [12], and patrolling games over networks, [2]. In particular, in [24], the authors determine the optimal patroling strategy on a border by considering a zero sum simultaneous game over a line network.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Network interdiction models tend to follow the process outlined by Smith (2008). Dimitrov and Morton (2013) describe four applications of network interdiction modeling, including one that is similar to the case study model, in this work: identifying vulnerabilities in an electric power system. Work that utilized the notion of network interdiction for analyzing source-destination path availability in a network infrastructure was conducted by Murray, et al (2007) and Matisziw and Murray (2009).…”
Section: Network Interdiction Modelingmentioning
confidence: 99%
“…Given a graph G with n nodes, a regression task on graphstructured data based on G consists of approximating a function F : Ω ⊆R n → R m , m ≤ n, depending on the adjacency matrix of G, and that returns the m values related to a fixed subset of m nodes for each set of values assigned to the nodes of G. This type of regression task has applications in many interesting fields, such as circulation with demand (CwD) problems (see [chap. 7.7] in [14]), network interdiction models (NIMs) [15], and flux regression problems in underground fractured media [16,17]. A classic multi-layer perceptron (MLP), or its suitable variants, can perform this regression task on the graph data with a good performance [16,17], implicitly learning the node relationships during the training (see [18,19]).…”
Section: Introductionmentioning
confidence: 99%