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 7 of 7 for “"Interdiction Problem"”.
-
Distributionally robust solution schemes for two-stage optimization and interdiction problems under uncertainty
… uncertain parameters to formulate the decision problems. Despite its wide applications in real-world problems, optimization under uncertainty gives rise to computational challenges. This thesis aims to design tractable solution schemes with performance guarantees for two-stage optimization and …
-
Models and Methodologies to Address Emerging Needs in Network and Supply Chain Optimization
… propose solution methodologies to address each problem. </p> <p>Chapter 2 presents a large-scale optimization approach for solving a dynamic bi-level network interdiction problem (NIP) in which interdiction activities must be scheduled in order to minimize the cumulative maximum flow over a …
-
Network security and min-cost max-flow problem
… for a variety of design and operational problems. This has resulted in the development of computational algorithms for the study of classical operations research problems such as the maximum flow problem, the shortest path problem, and the network interdiction problem. However, in …
-
Algorithms for Distributionally Risk-Receptive and Robust Stochastic Integer Programs and Interdiction Problems
… with a particular focus on adversarial games and interdiction problems. We introduce models within both distributionally risk-receptive (DRR) and distributionally robust optimization (DRO) frameworks, allowing for an adjustment of decision-maker's risk attitudes in adversarial settings. A key …
-
Algorithms for Networks With Uncertainty
<p>In this dissertation, we study algorithmic problems motivated by the optimization of networks under uncertainty.</p><p>We summarize our contributions:</p><p>\begin{itemize}</p><p>\item \textbf{Subset $k$-server:} We propose and give algorithms for the \emph{all-or-one $k$-server}, a …
-
OPTIMISATION AND INTERDICTION PROBLEMS FOR NETWORK SAFETY
In this thesis, we explore optimisation problems related to security, focusing on real-world systems that can be modelled using graphs or binary matrices. The first problem we examine is the Weighted Safe Set Problem, a graph optimisation problem that seeks to identify vertex partitions satisfying …
-
Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods
… addresses 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 …