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 8 of 8 for “"Network interdiction"”.

  1. 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 …

    vt Repository record for Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods (opens in a new tab)

  2. 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 …

    purdue-thes Repository record for DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND (opens in a new tab)

  3. Fundamental limit of network flow attacks

    A network flow-based attack refers to a cyber-attack where the adversary seeks to block user traffic from transmission by sending adversarial traffic that reduces the available user capacity. In this thesis, we explore the fundamental limits of network flow attacks by investigating its feasibility …

    mit Repository record for Fundamental limit of network flow attacks (opens in a new tab)

  4. Models and Methodologies to Address Emerging Needs in Network and Supply Chain 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 finite time horizon. A logic-based decomposition (LBD) approach is proposed that utilizes constraint …

    arkansas Repository record for Models and Methodologies to Address Emerging Needs in Network and Supply Chain Optimization (opens in a new tab)

  5. Network security and min-cost max-flow problem

    Network optimization has widely been studied in the literature 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 …

    mit Repository record for Network security and min-cost max-flow problem (opens in a new tab)

  6. 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 …

    vt Repository record for Algorithms for Distributionally Risk-Receptive and Robust Stochastic Integer Programs and Interdiction Problems (opens in a new tab)

  7. Security of Cyber-Physical Systems with Human Actors: Theoretical Foundations, Game Theory, and Bounded Rationality

    … to transform cities, infrastructure, and networked systems into more efficient, interactive, and interconnected smart systems. However, this ubiquitous connectivity leaves CPSs vulnerable to menacing security threats as evidenced by the recent discovery of the Stuxnet worm and the Mirai …

    vt Repository record for Security of Cyber-Physical Systems with Human Actors: Theoretical Foundations, Game Theory, and Bounded Rationality (opens in a new tab)

  8. The generalized critical node detection problem

    Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2025-12-01

    uiuc Repository record for The generalized critical node detection problem (opens in a new tab)