Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 52 for “"Network interdiction"”.
-
Network interdiction models
… which determine strategies to interdict a network using limited resources. The first model identifies a set of arcs whose interdiction minimizes the maximum flow through the network, constrained by the available resources. The second model identifies a set of arcs whose interdiction …
-
Network Interdiction under Uncertainty
We consider variants to one of the most common network interdiction formulations: the shortest path interdiction problem. This problem involves leader and a follower playing a zero-sum game over a directed network. The leader interdicts a set of arcs, and arc costs increase each time they are …
-
Stochastic network interdiction games
Network interdiction problems consist of games between an attacker and an intelligent network, where the attacker seeks to degrade network operations while the network adapts its operations to counteract the effects of the attacker. This problem has received significant attention in recent years …
-
Stochastic network interdiction: models and methods
We develop stochastic network interdiction models and associated solution methods. In its simplest form, our model consists of a smuggler who wishes to traverse a network from an origin to a destination without being detected. Probabilities associated with the indigenous transportation network …
-
Robust Maximum Flow Network Interdiction Problem
In this thesis, a maximum flow-based network interdiction problem considering uncertainties in arc capacities and interdiction resource consumption is solved. The problem consists of two entities with opposing objectives: the goal of the adversary is to maximize the flow of illicit drugs through …
-
Partial-enumeration for planar network interdiction problems
In the network interdiction problem, an interdictor destroys a set of arcs in a capacitated network through which an adversary will maximize flow. The interdictor's primary objective is to use his limited resources to minimize that maximum flow, but other objectives may be important. Therefore, we …
-
Robust Network Interdiction with Invisible Interdiction Assets
We study a version of the shortest path network interdiction problem in which the follower seeks to find the shortest path on a given network and the leader seeks to maximize the follower's shortest path length by interdicting arcs. We consider placement of interdictions that are not visible to the …
-
Evoluční algoritmy pro úlohy typu Network Interdiction
Úlohy typu Network interdiction jsou poměrně starým typem optimalizačních problémů, přesto však nejsou příliš známé. Během jejich vývoje bylo zkoumáno několik různých postupů k jejich řešení, přičemž většina z nich vycházela z vyžití duálních funkcí. Tato práce se však na uvedený přístup nezaměřuje …
-
The K-group maximum-flow network-interdiction problem
We study the K-group network-interdiction problem (KNIP) in which a "network user" attempts to maximize flow among K >/= 3 "node groups", while an "interdictor" interdicts (destroys) network arcs, using limited interdiction resources, to minimize this maximum flow. We develop two models to solve or …
-
Prioritization and optimization in stochastic network interdiction problems
The goal of a network interdiction problem is to model competitive decision-making between two parties with opposing goals. The simplest interdiction problem is a bilevel model consisting of an 'adversary' and an interdictor. In this setting, the interdictor first expends resources to optimally …
-
Bilevel Network Interdiction Models for Human Trafficking Disruption
… this dissertation, we study a series of bilevel network interdiction problems motivated by applications in human trafficking disruption. First, we consider a bilevel network interdiction problem where the follower aims to maximize the amount of flow from the source node to the sink node and the …
-
Approximation Algorithms for Network Interdiction and Fortification Problems
… graph problems which can all be classified as network interdiction and network fortification problems. The first problem studied, the multiway cut problem, is a generalization of the well–studied s–t min–cut problem, in which we must remove a minimum–cost subset of edges from a graph so that r …
-
Network interdiction by Lagrangian relaxation and branch-and-bound
The maximum-flow network-interdiction problem (MXFI) arises when an interdictor, using limited interdiction resources, wishes to restrict an adversary's use of a capacitated network. MXFI is not easy to solve when converted to a binary integer program. Derbes (1997) uses Lagrangian relaxation to …
-
Computational methods for deterministic and stochastic network interdiction problems
Using limited resources, a network interdictor attempts to disable components of a capacitated network with the objective of minimizing the maximum network flow achievable by the network user. This problem has applications to reducing the importation of illegal drugs and planning wartime air …
-
A Lagrangian Heuristic for solving a network interdiction problem
… solving or approximately solving a maximum-flow network-interdiction problem denoted MXFI: A network user strives to maximize flow of a commodity through a capacitated network, while an interdictor, with limited assets, attempts to destroy links in the network to minimize that maximum flow. MXFI …
-
Stochastic network interdiction for optimizing defensive counter air operations planning
This thesis describes a stochastic, network interdiction optimization model to guide defensive, counter-air (DCA) operations planning. We model a layered, integrated air-defense system, which consists of fighter and missile engagement zones. We extend an existing two-stage, stochastic, …
-
Two-person games for stochastic network interdiction : models, methods, and complexities
We describe a stochastic network interdiction problem in which an interdictor, subject to limited resources, installs radiation detectors at border checkpoints in a transportation network in order to minimize the probability that a smuggler of nuclear material can traverse the residual network …
-
Two-person zero-sum network-interdiction game with multiple inspector types
Wood (1995) to handle multiple types of interdiction assets (e.g., aircraft, ground-based inspection teams), referred to here as "inspectors." A single evader attempts to traverse a path between two vertices in a directed network while an interdictor, controlling inspectors of different types, …
-
Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods
… five fundamental resource allocation problems on networks, all of which have applications to support Homeland Security or industry challenges. In the first application, we model and solve the strategic problem of minimizing the expected loss inflicted by a hostile terrorist organization. An …
-
DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND
… of practical problems ranging from communication network design to power market analysis. There are strong links between the tools used to analyze NEPs and the classical techniques of nonlinear and combinatorial optimization. However, there remain significant challenges in both the theoretical and …
Page 1 of 3