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 44 for “"Interdiction Problem"”.
-
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 …
-
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 …
-
A Lagrangian Heuristic for solving a network interdiction problem
… 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 can be …
-
The threshold shortest path interdiction problem for critical infrastructure resilience analysis
… formulate and solve the threshold shortest path interdiction problem, which we define as follows: Find a finite set of arcs to attack within a network such that the resulting shortest path from a given source node to a given destination is longer than a specified threshold. Ultimately we are …
-
A Branch-and-Cut Method for Solving the Bilevel Clique Interdiction Problem
… the current formulation of the bilevel clique interdiction problem. Interdiction, a military term, describes the removal of enemy resources. The single level clique interdiction problem describes the attempt of an attacker to interdict a maximum number of cliques. The bilevel form of the …
-
On the connectivity interdiction problem, the geometry of data structures and Eulerian circuits
… the study of algorithms for optimization problems has become one of the main areas in theoretical computer science. Computer algorithms are nowadays an ubiquitous tool in optimization applications like food production, voting systems, route scheduling, transportation, protein synthesis and …
-
RUNTIME ANALYSIS OF BENDERS DECOMPOSITION AND DUAL ILP ALGORITHMS AS APPLIED TO COMMON NETWORK INTERDICTION PROBLEMS
… network. This thesis analyzes two network interdiction algorithms, Benders decomposition and a dual integer linear program approach, to compare their computational efficiency on the shortest path and maximum flow interdiction problems. We construct networks using two operationally …
-
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 Clique Interdiction and Related Problems
I introduce a formulation of the bilevel clique interdiction problem. Interdiction, a military term, describes the removal of enemy resources. The single level clique interdiction problem describes the attempt of an attacker to interdict a maximum number of cliques. The bilevel form of the problem …
-
Delaying a convoy
This thesis studies "the convoy-path interdiction problem" (CPIP) in which an interdictor uses limited resources to attack and disrupt road segments ("arcs") or road intersections ("nodes") in a road network in order to delay an adversary's convoy from reaching its destination. The convoy will move …
-
Computational methods for deterministic and stochastic network interdiction problems
… flow achievable by the network user. This problem has applications to reducing the importation of illegal drugs and planning wartime air attacks against an enemy's supply lines. A deterministic model using Benders decomposition is developed and improved upon with an original …
-
Bilevel Network Interdiction Models for Human Trafficking Disruption
… 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 leader …
-
Selected Interdiction Games with Uncertain, Risk-Averse, and Simultaneous Play Considerations
This dissertation examines two network interdiction problems: a shortest-path interdiction problem under uncertainty and a network interdiction problem in a simultaneous game. Both problems happen in two stages over a directed network, and involve a leader and a follower who have opposing …
-
Interdicting smuggler movement with transparent and non-transparent assets
We analyze an interdiction problem in which a nuclear-material smuggler can traverse the rail and road ports of entry (POEs) along the Mexican and Canadian borders of the United States. Our objective is to determine the optimal locations of a limited number of transparent and non-transparent assets …
-
Analysis of smuggler movement on multiple transportation networks
We analyze an interdiction problem in which a nuclear-material smuggler can traverse multiple transportation networks, wherein each edge has an indigenous probability of evasion. Our objective is to determine the optimal locations of a limited number of radiation detectors at United States ports of …
-
Advancements on problems involving maximum flows
This thesis presents new results on a few problems involving maximum flows. The first topic we explore is maximum flow network interdiction. The second topic we explore is reoptimization heuristics for rapidly solving an entire sequence of Maximum Flow Problems. In the Cardinality Maximum Flow …
-
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 …
-
Decomposition Algorithms in Stochastic Integer Programming: Applications and Computations.
… develop a new framework for stochastic network interdiction problem to address ambiguity in the defender risk preferences. The second topic is dedicated to computational studies of two-stage stochastic integer programs. More specifically, we consider two cases. First, we develop some solution …
-
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 …
-
System interdiction and defense
We study the problem of interdicting components of an adversary's system, e.g., a war-time economy, a transportation network, etc. Basic techniques are developed and illustrated with a simple network interdiction problem, "maximizing the shortest path" (MXSP). In MXSP, an interdictor wishes to …
Page 1 of 3