Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Network Interdiction)`

.
Showing records 1 – 15 of
15 total matches.

▼ Search Limiters

Brno University of Technology

1. Cabalka, Matouš. Pokročilá optimalizace toků v sítích .

Degree: 2018, Brno University of Technology

URL: http://hdl.handle.net/11012/138014

► Diplomová práce se zabývá optimalizačními modely v logistice s důrazem na úlohu napadení sítě. Po stručném úvodu následují dvě přehledové kapitoly věnované teorii grafů a…
(more)

Subjects/Keywords: Matematické programování; lineární programování; toky v sítích; úloha o maximálním toku; duální úloha; úloha o minimálním řezu; úloha napadení sítě; dvoustupňové programování; stochastické programování; GAMS; Mathematical programming; linear programming; network flows; the maximum flow problem; dual problem; the minimum cut problem; network interdiction problem; two-stage programming; stochastic programming; GAMS

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Cabalka, M. (2018). Pokročilá optimalizace toků v sítích . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/138014

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Cabalka, Matouš. “Pokročilá optimalizace toků v sítích .” 2018. Thesis, Brno University of Technology. Accessed October 14, 2019. http://hdl.handle.net/11012/138014.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cabalka, Matouš. “Pokročilá optimalizace toků v sítích .” 2018. Web. 14 Oct 2019.

Vancouver:

Cabalka M. Pokročilá optimalizace toků v sítích . [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/11012/138014.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cabalka M. Pokročilá optimalizace toků v sítích . [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/138014

Not specified: Masters Thesis or Doctoral Dissertation

Clemson University

2.
Holzmann, Timothy.
*Network**Interdiction* under Uncertainty.

Degree: PhD, Industrial Engineering, 2019, Clemson University

URL: https://tigerprints.clemson.edu/all_dissertations/2437

► We consider variants to one of the most common *network* *interdiction* formulations: the shortest path *interdiction* problem. This problem involves leader and a follower…
(more)

Subjects/Keywords: Combinatorial Optimization; Industrial Engineering; Mathematical Programming; Multiobjective Optimization; Network Interdiction

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Holzmann, T. (2019). Network Interdiction under Uncertainty. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/2437

Chicago Manual of Style (16^{th} Edition):

Holzmann, Timothy. “Network Interdiction under Uncertainty.” 2019. Doctoral Dissertation, Clemson University. Accessed October 14, 2019. https://tigerprints.clemson.edu/all_dissertations/2437.

MLA Handbook (7^{th} Edition):

Holzmann, Timothy. “Network Interdiction under Uncertainty.” 2019. Web. 14 Oct 2019.

Vancouver:

Holzmann T. Network Interdiction under Uncertainty. [Internet] [Doctoral dissertation]. Clemson University; 2019. [cited 2019 Oct 14]. Available from: https://tigerprints.clemson.edu/all_dissertations/2437.

Council of Science Editors:

Holzmann T. Network Interdiction under Uncertainty. [Doctoral Dissertation]. Clemson University; 2019. Available from: https://tigerprints.clemson.edu/all_dissertations/2437

Georgia Tech

3. Altner, Douglas S. Advancements on problems involving maximum flows.

Degree: PhD, Industrial and Systems Engineering, 2008, Georgia Tech

URL: http://hdl.handle.net/1853/24828

► 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…
(more)

Subjects/Keywords: Network interdiction; Reoptimization; Robust minimum cuts; Maximum flows; Mathematical optimization; Linear programming; Maximal functions

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Altner, D. S. (2008). Advancements on problems involving maximum flows. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/24828

Chicago Manual of Style (16^{th} Edition):

Altner, Douglas S. “Advancements on problems involving maximum flows.” 2008. Doctoral Dissertation, Georgia Tech. Accessed October 14, 2019. http://hdl.handle.net/1853/24828.

MLA Handbook (7^{th} Edition):

Altner, Douglas S. “Advancements on problems involving maximum flows.” 2008. Web. 14 Oct 2019.

Vancouver:

Altner DS. Advancements on problems involving maximum flows. [Internet] [Doctoral dissertation]. Georgia Tech; 2008. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/1853/24828.

Council of Science Editors:

Altner DS. Advancements on problems involving maximum flows. [Doctoral Dissertation]. Georgia Tech; 2008. Available from: http://hdl.handle.net/1853/24828

Georgia Tech

4. Musselman, Amelia E. Planning and protecting critical infrastructure: Three applications of optimization under uncertainty or variability.

Degree: PhD, Industrial and Systems Engineering, 2017, Georgia Tech

URL: http://hdl.handle.net/1853/60147

► This dissertation presents the study of three strategic planning problems in the area of critical infrastructure planning and protection. Each of these problems involves real-world…
(more)

Subjects/Keywords: Network interdiction; Nuclear detection; Robust optimization; Bi-level programming; Sub-Saharan Africa; Electricity development; Power generation expansion planning; Wind siting; Multi-objective optimization

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Musselman, A. E. (2017). Planning and protecting critical infrastructure: Three applications of optimization under uncertainty or variability. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/60147

Chicago Manual of Style (16^{th} Edition):

Musselman, Amelia E. “Planning and protecting critical infrastructure: Three applications of optimization under uncertainty or variability.” 2017. Doctoral Dissertation, Georgia Tech. Accessed October 14, 2019. http://hdl.handle.net/1853/60147.

MLA Handbook (7^{th} Edition):

Musselman, Amelia E. “Planning and protecting critical infrastructure: Three applications of optimization under uncertainty or variability.” 2017. Web. 14 Oct 2019.

Vancouver:

Musselman AE. Planning and protecting critical infrastructure: Three applications of optimization under uncertainty or variability. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/1853/60147.

Council of Science Editors:

Musselman AE. Planning and protecting critical infrastructure: Three applications of optimization under uncertainty or variability. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/60147

Mississippi State University

5.
Nandi, Apurba Kumer.
*Network**interdiction* models and algorithms for information security.

Degree: PhD, Industrial and Systems Engineering, 2016, Mississippi State University

URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10072016-023829/ ;

► Major cyber attacks against the cyber networks of organizations has become a common phenomenon nowadays. Cyber attacks are carried out both through the spread…
(more)

Subjects/Keywords: constraint and column generation; multi-level programming; bi-level programming; Mixed Integer programming; cyber security; Attack graph; Network; Interdiction

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Nandi, A. K. (2016). Network interdiction models and algorithms for information security. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-10072016-023829/ ;

Chicago Manual of Style (16^{th} Edition):

Nandi, Apurba Kumer. “Network interdiction models and algorithms for information security.” 2016. Doctoral Dissertation, Mississippi State University. Accessed October 14, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-10072016-023829/ ;.

MLA Handbook (7^{th} Edition):

Nandi, Apurba Kumer. “Network interdiction models and algorithms for information security.” 2016. Web. 14 Oct 2019.

Vancouver:

Nandi AK. Network interdiction models and algorithms for information security. [Internet] [Doctoral dissertation]. Mississippi State University; 2016. [cited 2019 Oct 14]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10072016-023829/ ;.

Council of Science Editors:

Nandi AK. Network interdiction models and algorithms for information security. [Doctoral Dissertation]. Mississippi State University; 2016. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10072016-023829/ ;

6. ZHOU CHUNHUI. STRATEGIC DECISION MAKING IN SUPPLY CHAINS UNDER RISK OF DISRUPTIONS.

Degree: 2016, National University of Singapore

URL: http://scholarbank.nus.edu.sg/handle/10635/135193

Subjects/Keywords: supply chain risk management; supply chain partner selection; trade-offs; protection strategy; scenario reduction; network interdiction

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

CHUNHUI, Z. (2016). STRATEGIC DECISION MAKING IN SUPPLY CHAINS UNDER RISK OF DISRUPTIONS. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/135193

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

CHUNHUI, ZHOU. “STRATEGIC DECISION MAKING IN SUPPLY CHAINS UNDER RISK OF DISRUPTIONS.” 2016. Thesis, National University of Singapore. Accessed October 14, 2019. http://scholarbank.nus.edu.sg/handle/10635/135193.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

CHUNHUI, ZHOU. “STRATEGIC DECISION MAKING IN SUPPLY CHAINS UNDER RISK OF DISRUPTIONS.” 2016. Web. 14 Oct 2019.

Vancouver:

CHUNHUI Z. STRATEGIC DECISION MAKING IN SUPPLY CHAINS UNDER RISK OF DISRUPTIONS. [Internet] [Thesis]. National University of Singapore; 2016. [cited 2019 Oct 14]. Available from: http://scholarbank.nus.edu.sg/handle/10635/135193.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

CHUNHUI Z. STRATEGIC DECISION MAKING IN SUPPLY CHAINS UNDER RISK OF DISRUPTIONS. [Thesis]. National University of Singapore; 2016. Available from: http://scholarbank.nus.edu.sg/handle/10635/135193

Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

7.
Gao, Mengyao.
Protecting Road *Network* Against Intentional Attacks By
Near-optimal *Interdiction* Strategy.

Degree: MS, Industrial Engineering, 2014, Penn State University

URL: https://etda.libraries.psu.edu/catalog/22630

► In this study we investigate the vulnerability of road networks to interdictions. We consider that an intentional attacker wants to maximize the congestion level on…
(more)

Subjects/Keywords: road network; congestion; interdiction

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Gao, M. (2014). Protecting Road Network Against Intentional Attacks By Near-optimal Interdiction Strategy. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/22630

Chicago Manual of Style (16^{th} Edition):

Gao, Mengyao. “Protecting Road Network Against Intentional Attacks By Near-optimal Interdiction Strategy.” 2014. Masters Thesis, Penn State University. Accessed October 14, 2019. https://etda.libraries.psu.edu/catalog/22630.

MLA Handbook (7^{th} Edition):

Gao, Mengyao. “Protecting Road Network Against Intentional Attacks By Near-optimal Interdiction Strategy.” 2014. Web. 14 Oct 2019.

Vancouver:

Gao M. Protecting Road Network Against Intentional Attacks By Near-optimal Interdiction Strategy. [Internet] [Masters thesis]. Penn State University; 2014. [cited 2019 Oct 14]. Available from: https://etda.libraries.psu.edu/catalog/22630.

Council of Science Editors:

Gao M. Protecting Road Network Against Intentional Attacks By Near-optimal Interdiction Strategy. [Masters Thesis]. Penn State University; 2014. Available from: https://etda.libraries.psu.edu/catalog/22630

Purdue University

8.
Sreekumaran, Harikrishnan.
DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT *NETWORK* *INTERDICTION* GAMES AND BEYOND.

Degree: PhD, Industrial Engineering, 2015, Purdue University

URL: https://docs.lib.purdue.edu/open_access_dissertations/1432

► Nash equilibrium problems (NEPs) have gained popularity in recent years in the engineering community due to their ready applicability to a wide variety of practical…
(more)

Subjects/Keywords: Distributed optimization; Game theory; Network interdiction; Parallel algorithms

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Sreekumaran, H. (2015). DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND. (Doctoral Dissertation). Purdue University. Retrieved from https://docs.lib.purdue.edu/open_access_dissertations/1432

Chicago Manual of Style (16^{th} Edition):

Sreekumaran, Harikrishnan. “DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND.” 2015. Doctoral Dissertation, Purdue University. Accessed October 14, 2019. https://docs.lib.purdue.edu/open_access_dissertations/1432.

MLA Handbook (7^{th} Edition):

Sreekumaran, Harikrishnan. “DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND.” 2015. Web. 14 Oct 2019.

Vancouver:

Sreekumaran H. DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND. [Internet] [Doctoral dissertation]. Purdue University; 2015. [cited 2019 Oct 14]. Available from: https://docs.lib.purdue.edu/open_access_dissertations/1432.

Council of Science Editors:

Sreekumaran H. DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND. [Doctoral Dissertation]. Purdue University; 2015. Available from: https://docs.lib.purdue.edu/open_access_dissertations/1432

University of Florida

9.
Hemmati, Mehdi.
Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and *Network* *Interdiction* Problems.

Degree: PhD, Industrial and Systems Engineering, 2013, University of Florida

URL: http://ufdc.ufl.edu/UFE0045762

► In this dissertation, we study multilevel optimization andnetwork *interdiction* theory, and apply this theory across several applicationsettings. The common theme of all ourproblems involves competitive…
(more)

Subjects/Keywords: Algorithms; Customers; Integers; Linear programming; Mathematical sequences; Mathematical variables; Objective functions; Operations research; Optimal solutions; Product introduction; bilevel – interdiction – network – optimization

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hemmati, M. (2013). Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0045762

Chicago Manual of Style (16^{th} Edition):

Hemmati, Mehdi. “Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems.” 2013. Doctoral Dissertation, University of Florida. Accessed October 14, 2019. http://ufdc.ufl.edu/UFE0045762.

MLA Handbook (7^{th} Edition):

Hemmati, Mehdi. “Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems.” 2013. Web. 14 Oct 2019.

Vancouver:

Hemmati M. Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2019 Oct 14]. Available from: http://ufdc.ufl.edu/UFE0045762.

Council of Science Editors:

Hemmati M. Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems. [Doctoral Dissertation]. University of Florida; 2013. Available from: http://ufdc.ufl.edu/UFE0045762

University of Florida

10. Tang, Yen Thi. A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications.

Degree: PhD, Industrial and Systems Engineering, 2014, University of Florida

URL: http://ufdc.ufl.edu/UFE0046155

► In this dissertation, we construct algorithms to solve a class of mixed-integer bilevel min-max optimization problems, with applications to knapsack, clique, and evacuation problems. These…
(more)

Subjects/Keywords: Algorithms; Boxes; Disasters; Emergency evacuations; Integers; Iterative solutions; Linear programming; Mathematical models; Operations research; Optimal solutions; bilevel – evacuation – interdiction – mixed-integer – network – optimization

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Tang, Y. T. (2014). A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0046155

Chicago Manual of Style (16^{th} Edition):

Tang, Yen Thi. “A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications.” 2014. Doctoral Dissertation, University of Florida. Accessed October 14, 2019. http://ufdc.ufl.edu/UFE0046155.

MLA Handbook (7^{th} Edition):

Tang, Yen Thi. “A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications.” 2014. Web. 14 Oct 2019.

Vancouver:

Tang YT. A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications. [Internet] [Doctoral dissertation]. University of Florida; 2014. [cited 2019 Oct 14]. Available from: http://ufdc.ufl.edu/UFE0046155.

Council of Science Editors:

Tang YT. A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications. [Doctoral Dissertation]. University of Florida; 2014. Available from: http://ufdc.ufl.edu/UFE0046155

University of Florida

11.
Sullivan, Kelly M.
Two-Level System * Interdiction*.

Degree: PhD, Industrial and Systems Engineering, 2012, University of Florida

URL: http://ufdc.ufl.edu/UFE0044471

► We consider a number of *interdiction* problems with applications in homeland security. First, we study a stochastic *interdiction* model formulated by Morton et al. (IIE…
(more)

Subjects/Keywords: Algorithms; Cardinality; Integers; Linear programming; Objective functions; Operations research; Optimal solutions; P values; Sensors; Smuggling; discrete – interdiction – network – nuclear – optimization

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Sullivan, K. M. (2012). Two-Level System Interdiction. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0044471

Chicago Manual of Style (16^{th} Edition):

Sullivan, Kelly M. “Two-Level System Interdiction.” 2012. Doctoral Dissertation, University of Florida. Accessed October 14, 2019. http://ufdc.ufl.edu/UFE0044471.

MLA Handbook (7^{th} Edition):

Sullivan, Kelly M. “Two-Level System Interdiction.” 2012. Web. 14 Oct 2019.

Vancouver:

Sullivan KM. Two-Level System Interdiction. [Internet] [Doctoral dissertation]. University of Florida; 2012. [cited 2019 Oct 14]. Available from: http://ufdc.ufl.edu/UFE0044471.

Council of Science Editors:

Sullivan KM. Two-Level System Interdiction. [Doctoral Dissertation]. University of Florida; 2012. Available from: http://ufdc.ufl.edu/UFE0044471

University of Florida

12.
Prince, Michael D.
Algorithms and Reformulation Techniques for Three-Stage *Interdiction* and Fortification Problems.

Degree: PhD, Industrial and Systems Engineering, 2013, University of Florida

URL: http://ufdc.ufl.edu/UFE0045177

► In this paper we present several optimization problems in supply chains and logistics. The first group of problems we analyze involve a procurement optimization problem…
(more)

Subjects/Keywords: Algorithms; Capacity costs; Forts; Integers; Linear programming; Minimization of cost; Objective functions; Operations research; Optimal solutions; Procurement; facility – fortification – interdiction – mixed-integer – network – optimization – procurement

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Prince, M. D. (2013). Algorithms and Reformulation Techniques for Three-Stage Interdiction and Fortification Problems. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0045177

Chicago Manual of Style (16^{th} Edition):

Prince, Michael D. “Algorithms and Reformulation Techniques for Three-Stage Interdiction and Fortification Problems.” 2013. Doctoral Dissertation, University of Florida. Accessed October 14, 2019. http://ufdc.ufl.edu/UFE0045177.

MLA Handbook (7^{th} Edition):

Prince, Michael D. “Algorithms and Reformulation Techniques for Three-Stage Interdiction and Fortification Problems.” 2013. Web. 14 Oct 2019.

Vancouver:

Prince MD. Algorithms and Reformulation Techniques for Three-Stage Interdiction and Fortification Problems. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2019 Oct 14]. Available from: http://ufdc.ufl.edu/UFE0045177.

Council of Science Editors:

Prince MD. Algorithms and Reformulation Techniques for Three-Stage Interdiction and Fortification Problems. [Doctoral Dissertation]. University of Florida; 2013. Available from: http://ufdc.ufl.edu/UFE0045177

13.
Hong, Sunghoon.
The Economics of *Network* Flows.

Degree: PhD, Economics, 2012, Vanderbilt University

URL: http://etd.library.vanderbilt.edu/available/etd-04172012-111943/ ;

► My research on the economics of *network* flows is motivated by (i) the possibility of bads being carried through networks, together with goods, (ii) the…
(more)

Subjects/Keywords: bottlenecks; network goods; network bads; network flows; interdiction; efficiency; equilibrium

…research also
advances models and results on *network* *interdiction*.
Chapter III introduces a… …Database.
3
CHAPTER II
STRATEGIC *NETWORK* *INTERDICTION*
Introduction
This chapter introduces a… …contributes to the literature on *network* *interdiction*. Washburn
and Wood (40) introduce a… …this game.3
My model differs from the existing models on *network* *interdiction* in four aspects… …3
Other than these papers, most of the literature on *network* *interdiction* deals with an…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hong, S. (2012). The Economics of Network Flows. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu/available/etd-04172012-111943/ ;

Chicago Manual of Style (16^{th} Edition):

Hong, Sunghoon. “The Economics of Network Flows.” 2012. Doctoral Dissertation, Vanderbilt University. Accessed October 14, 2019. http://etd.library.vanderbilt.edu/available/etd-04172012-111943/ ;.

MLA Handbook (7^{th} Edition):

Hong, Sunghoon. “The Economics of Network Flows.” 2012. Web. 14 Oct 2019.

Vancouver:

Hong S. The Economics of Network Flows. [Internet] [Doctoral dissertation]. Vanderbilt University; 2012. [cited 2019 Oct 14]. Available from: http://etd.library.vanderbilt.edu/available/etd-04172012-111943/ ;.

Council of Science Editors:

Hong S. The Economics of Network Flows. [Doctoral Dissertation]. Vanderbilt University; 2012. Available from: http://etd.library.vanderbilt.edu/available/etd-04172012-111943/ ;

14. Saleck Pay, Babak. Decomposition Algorithms in Stochastic Integer Programming: Applications and Computations.

Degree: PhD, Mathematical Sciences, 2017, Virginia Commonwealth University

URL: https://scholarscompass.vcu.edu/etd/5027

► In this dissertation we focus on two main topics. Under the first topic, we develop a new framework for stochastic *network* *interdiction* problem to address…
(more)

Subjects/Keywords: Stochastic Network Interdiction; Incomplete Preferences Information; Two-stage Stochastic Integer Programming; Industrial Engineering; Operational Research; Other Operations Research, Systems Engineering and Industrial Engineering; Systems Engineering

…instances
with various *network* sizes, *interdiction* budgets, and scenario sizes. . . . .
51… …the first topic, we
develop a new framework for stochastic *network* *interdiction* problem to… …integer programs with integer recourse.
We study a class of stochastic *network* *interdiction*… …focus on the shortest path
*network* *interdiction* modeled as a Stackelberg game, where the… …*interdiction* effects in the *network*. We take a decision-analytic perspective in addressing…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Saleck Pay, B. (2017). Decomposition Algorithms in Stochastic Integer Programming: Applications and Computations. (Doctoral Dissertation). Virginia Commonwealth University. Retrieved from https://scholarscompass.vcu.edu/etd/5027

Chicago Manual of Style (16^{th} Edition):

Saleck Pay, Babak. “Decomposition Algorithms in Stochastic Integer Programming: Applications and Computations.” 2017. Doctoral Dissertation, Virginia Commonwealth University. Accessed October 14, 2019. https://scholarscompass.vcu.edu/etd/5027.

MLA Handbook (7^{th} Edition):

Saleck Pay, Babak. “Decomposition Algorithms in Stochastic Integer Programming: Applications and Computations.” 2017. Web. 14 Oct 2019.

Vancouver:

Saleck Pay B. Decomposition Algorithms in Stochastic Integer Programming: Applications and Computations. [Internet] [Doctoral dissertation]. Virginia Commonwealth University; 2017. [cited 2019 Oct 14]. Available from: https://scholarscompass.vcu.edu/etd/5027.

Council of Science Editors:

Saleck Pay B. Decomposition Algorithms in Stochastic Integer Programming: Applications and Computations. [Doctoral Dissertation]. Virginia Commonwealth University; 2017. Available from: https://scholarscompass.vcu.edu/etd/5027

Virginia Tech

15.
Lunday, Brian Joseph.
Resource Allocation on Networks: Nested Event Tree Optimization, *Network* *Interdiction*, and Game Theoretic Methods.

Degree: PhD, Industrial and Systems Engineering, 2010, Virginia Tech

URL: http://hdl.handle.net/10919/77323

► This dissertation addresses five fundamental resource allocation problems on networks, all of which have applications to support Homeland Security or industry challenges. In the first…
(more)

Subjects/Keywords: network interdiction; factorable programs; resource allocation; global optimization; minimax flow problems; synergy; inner-linearization; outer-approximation; network evasion; overt and covert strategies; dynamic formulation; fleet allocation; Shapley values; marginal cost analysis; railcar management

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lunday, B. J. (2010). Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/77323

Chicago Manual of Style (16^{th} Edition):

Lunday, Brian Joseph. “Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods.” 2010. Doctoral Dissertation, Virginia Tech. Accessed October 14, 2019. http://hdl.handle.net/10919/77323.

MLA Handbook (7^{th} Edition):

Lunday, Brian Joseph. “Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods.” 2010. Web. 14 Oct 2019.

Vancouver:

Lunday BJ. Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods. [Internet] [Doctoral dissertation]. Virginia Tech; 2010. [cited 2019 Oct 14]. Available from: http://hdl.handle.net/10919/77323.

Council of Science Editors:

Lunday BJ. Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods. [Doctoral Dissertation]. Virginia Tech; 2010. Available from: http://hdl.handle.net/10919/77323