Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:( network interdiction problem). Showing records 1 – 30 of 28778 total matches.

[1] [2] [3] [4] [5] … [960]

Search Limiters

Last 2 Years | English Only

Degrees

Languages

Country

▼ Search Limiters


Penn State University

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Gao M. Protecting Road Network Against Intentional Attacks By Near-optimal Interdiction Strategy. [Internet] [Masters thesis]. Penn State University; 2014. [cited 2019 Dec 12]. 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


Brno University of Technology

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

Degree: 2018, Brno University of Technology

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

Cabalka, Matouš. “Pokročilá optimalizace toků v sítích .” 2018. Thesis, Brno University of Technology. Accessed December 12, 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 (7th Edition):

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

Vancouver:

Cabalka M. Pokročilá optimalizace toků v sítích . [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2019 Dec 12]. 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Clemson University

3. Lozano, Leonardo. Exact Algorithms for Mixed-Integer Multilevel Programming Problems.

Degree: PhD, Industrial Engineering, 2017, Clemson University

 We examine multistage optimization problems, in which one or more decision makers solve a sequence of interdependent optimization problems. In each stage the corresponding decision… (more)

Subjects/Keywords: Bilevel optimization; Integer programming; Interdiction; Multistage optimization; Traveling salesman problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lozano, L. (2017). Exact Algorithms for Mixed-Integer Multilevel Programming Problems. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/1998

Chicago Manual of Style (16th Edition):

Lozano, Leonardo. “Exact Algorithms for Mixed-Integer Multilevel Programming Problems.” 2017. Doctoral Dissertation, Clemson University. Accessed December 12, 2019. https://tigerprints.clemson.edu/all_dissertations/1998.

MLA Handbook (7th Edition):

Lozano, Leonardo. “Exact Algorithms for Mixed-Integer Multilevel Programming Problems.” 2017. Web. 12 Dec 2019.

Vancouver:

Lozano L. Exact Algorithms for Mixed-Integer Multilevel Programming Problems. [Internet] [Doctoral dissertation]. Clemson University; 2017. [cited 2019 Dec 12]. Available from: https://tigerprints.clemson.edu/all_dissertations/1998.

Council of Science Editors:

Lozano L. Exact Algorithms for Mixed-Integer Multilevel Programming Problems. [Doctoral Dissertation]. Clemson University; 2017. Available from: https://tigerprints.clemson.edu/all_dissertations/1998


Clemson University

4. Holzmann, Timothy. Network Interdiction under Uncertainty.

Degree: PhD, Industrial Engineering, 2019, Clemson University

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Holzmann, Timothy. “Network Interdiction under Uncertainty.” 2019. Web. 12 Dec 2019.

Vancouver:

Holzmann T. Network Interdiction under Uncertainty. [Internet] [Doctoral dissertation]. Clemson University; 2019. [cited 2019 Dec 12]. 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


Purdue University

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

Degree: PhD, Industrial Engineering, 2015, Purdue University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Sreekumaran, Harikrishnan. “DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND.” 2015. Web. 12 Dec 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 Dec 12]. 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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 December 12, 2019. http://ufdc.ufl.edu/UFE0045762.

MLA Handbook (7th Edition):

Hemmati, Mehdi. “Multilevel Discrete Formulations and Algorithms with Applications to New Production Introduction Games and Network Interdiction Problems.” 2013. Web. 12 Dec 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 Dec 12]. 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

7. Sullivan, Kelly M. Two-Level System Interdiction.

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Sullivan, Kelly M. “Two-Level System Interdiction.” 2012. Web. 12 Dec 2019.

Vancouver:

Sullivan KM. Two-Level System Interdiction. [Internet] [Doctoral dissertation]. University of Florida; 2012. [cited 2019 Dec 12]. 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


Mississippi State University

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

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

  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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Nandi AK. Network interdiction models and algorithms for information security. [Internet] [Doctoral dissertation]. Mississippi State University; 2016. [cited 2019 Dec 12]. 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/ ;

9. Hong, Sunghoon. The Economics of Network Flows.

Degree: PhD, Economics, 2012, Vanderbilt University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Hong, Sunghoon. “The Economics of Network Flows.” 2012. Web. 12 Dec 2019.

Vancouver:

Hong S. The Economics of Network Flows. [Internet] [Doctoral dissertation]. Vanderbilt University; 2012. [cited 2019 Dec 12]. 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/ ;


NSYSU

10. Tsai, Ping-cheng. MCCA: The Novel Ways for Multiple Cluster Collision Avoidance in TDMA Cluster-based Wireless Sensor Networks.

Degree: Master, Computer Science and Engineering, 2008, NSYSU

 Wireless sensor networks typically consist of a significant number of low-cost sensor nodes which can collaborate among each other to execute a wide range of… (more)

Subjects/Keywords: sensor network; Multiple Cluster Collision Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tsai, P. (2008). MCCA: The Novel Ways for Multiple Cluster Collision Avoidance in TDMA Cluster-based Wireless Sensor Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0724108-093824

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Tsai, Ping-cheng. “MCCA: The Novel Ways for Multiple Cluster Collision Avoidance in TDMA Cluster-based Wireless Sensor Networks.” 2008. Thesis, NSYSU. Accessed December 12, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0724108-093824.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tsai, Ping-cheng. “MCCA: The Novel Ways for Multiple Cluster Collision Avoidance in TDMA Cluster-based Wireless Sensor Networks.” 2008. Web. 12 Dec 2019.

Vancouver:

Tsai P. MCCA: The Novel Ways for Multiple Cluster Collision Avoidance in TDMA Cluster-based Wireless Sensor Networks. [Internet] [Thesis]. NSYSU; 2008. [cited 2019 Dec 12]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0724108-093824.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tsai P. MCCA: The Novel Ways for Multiple Cluster Collision Avoidance in TDMA Cluster-based Wireless Sensor Networks. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0724108-093824

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

11. Zarnegar, Armita. Regulatory network discovery using heuristics.

Degree: PhD, 2011, Federation University Australia

This thesis improves the GRN discovery process by integrating heuristic information via a co-regulation function, a post-processing procedure, and a Hub Network algorithm to build the backbone of the network.

Doctor of Philosophy

Subjects/Keywords: Heuristic methods; Problem solving; Gene regulatory network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zarnegar, A. (2011). Regulatory network discovery using heuristics. (Doctoral Dissertation). Federation University Australia. Retrieved from http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/33373

Chicago Manual of Style (16th Edition):

Zarnegar, Armita. “Regulatory network discovery using heuristics.” 2011. Doctoral Dissertation, Federation University Australia. Accessed December 12, 2019. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/33373.

MLA Handbook (7th Edition):

Zarnegar, Armita. “Regulatory network discovery using heuristics.” 2011. Web. 12 Dec 2019.

Vancouver:

Zarnegar A. Regulatory network discovery using heuristics. [Internet] [Doctoral dissertation]. Federation University Australia; 2011. [cited 2019 Dec 12]. Available from: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/33373.

Council of Science Editors:

Zarnegar A. Regulatory network discovery using heuristics. [Doctoral Dissertation]. Federation University Australia; 2011. Available from: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/33373

12. Erickson, Andrew. Using Graph Databases to Address Network Complexity Problems that can Hinder Security Incident Response.

Degree: Information Assurance: M.S., Information Assurance and Information Systems, 2019, St. Cloud State University

  The network complexity problem within computer security incident response is an issue pertaining to the complexity of a computer network as it grows in… (more)

Subjects/Keywords: Graph Database Incident Response Network Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Erickson, A. (2019). Using Graph Databases to Address Network Complexity Problems that can Hinder Security Incident Response. (Masters Thesis). St. Cloud State University. Retrieved from https://repository.stcloudstate.edu/msia_etds/88

Chicago Manual of Style (16th Edition):

Erickson, Andrew. “Using Graph Databases to Address Network Complexity Problems that can Hinder Security Incident Response.” 2019. Masters Thesis, St. Cloud State University. Accessed December 12, 2019. https://repository.stcloudstate.edu/msia_etds/88.

MLA Handbook (7th Edition):

Erickson, Andrew. “Using Graph Databases to Address Network Complexity Problems that can Hinder Security Incident Response.” 2019. Web. 12 Dec 2019.

Vancouver:

Erickson A. Using Graph Databases to Address Network Complexity Problems that can Hinder Security Incident Response. [Internet] [Masters thesis]. St. Cloud State University; 2019. [cited 2019 Dec 12]. Available from: https://repository.stcloudstate.edu/msia_etds/88.

Council of Science Editors:

Erickson A. Using Graph Databases to Address Network Complexity Problems that can Hinder Security Incident Response. [Masters Thesis]. St. Cloud State University; 2019. Available from: https://repository.stcloudstate.edu/msia_etds/88


University of Florida

13. 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th 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 December 12, 2019. http://ufdc.ufl.edu/UFE0046155.

MLA Handbook (7th Edition):

Tang, Yen Thi. “A Class of Algorithms for Mixed-Integer Bilevel Min-Max Optimization Problems with Applications.” 2014. Web. 12 Dec 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 Dec 12]. 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


Georgia Tech

14. 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Musselman, Amelia E. “Planning and protecting critical infrastructure: Three applications of optimization under uncertainty or variability.” 2017. Web. 12 Dec 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 Dec 12]. 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


University of Florida

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Prince MD. Algorithms and Reformulation Techniques for Three-Stage Interdiction and Fortification Problems. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2019 Dec 12]. 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


Ohio University

16. Samadi Dinani, Mahnoush. Scalable Heuristics for Solving the p-median Problem on Real Road Networks.

Degree: MS, Industrial and Systems Engineering (Engineering and Technology), 2018, Ohio University

 The P-median problem is a network location problem in which p facilities are to be located with respect to a set of demand points. The… (more)

Subjects/Keywords: Industrial Engineering; network location; p-median problem; p-hub median problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Samadi Dinani, M. (2018). Scalable Heuristics for Solving the p-median Problem on Real Road Networks. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1543837653046322

Chicago Manual of Style (16th Edition):

Samadi Dinani, Mahnoush. “Scalable Heuristics for Solving the p-median Problem on Real Road Networks.” 2018. Masters Thesis, Ohio University. Accessed December 12, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1543837653046322.

MLA Handbook (7th Edition):

Samadi Dinani, Mahnoush. “Scalable Heuristics for Solving the p-median Problem on Real Road Networks.” 2018. Web. 12 Dec 2019.

Vancouver:

Samadi Dinani M. Scalable Heuristics for Solving the p-median Problem on Real Road Networks. [Internet] [Masters thesis]. Ohio University; 2018. [cited 2019 Dec 12]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1543837653046322.

Council of Science Editors:

Samadi Dinani M. Scalable Heuristics for Solving the p-median Problem on Real Road Networks. [Masters Thesis]. Ohio University; 2018. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1543837653046322


Brunel University

17. Iqbal, Muhamad Syamsu. Performance of IEEE 802.15.4 beaconless-enabled protocol for low data rate ad hoc wireless sensor networks.

Degree: PhD, 2016, Brunel University

 This thesis focuses on the enhancement of the IEEE 802.15.4 beaconless-enabled MAC protocol as a solution to overcome the network bottleneck, less flexible nodes, and… (more)

Subjects/Keywords: 621.382; Network simulator NS-2; Hidden nodes problem; Large scale network; Power efficiency; Network bottleneck problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Iqbal, M. S. (2016). Performance of IEEE 802.15.4 beaconless-enabled protocol for low data rate ad hoc wireless sensor networks. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/12852 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687669

Chicago Manual of Style (16th Edition):

Iqbal, Muhamad Syamsu. “Performance of IEEE 802.15.4 beaconless-enabled protocol for low data rate ad hoc wireless sensor networks.” 2016. Doctoral Dissertation, Brunel University. Accessed December 12, 2019. http://bura.brunel.ac.uk/handle/2438/12852 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687669.

MLA Handbook (7th Edition):

Iqbal, Muhamad Syamsu. “Performance of IEEE 802.15.4 beaconless-enabled protocol for low data rate ad hoc wireless sensor networks.” 2016. Web. 12 Dec 2019.

Vancouver:

Iqbal MS. Performance of IEEE 802.15.4 beaconless-enabled protocol for low data rate ad hoc wireless sensor networks. [Internet] [Doctoral dissertation]. Brunel University; 2016. [cited 2019 Dec 12]. Available from: http://bura.brunel.ac.uk/handle/2438/12852 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687669.

Council of Science Editors:

Iqbal MS. Performance of IEEE 802.15.4 beaconless-enabled protocol for low data rate ad hoc wireless sensor networks. [Doctoral Dissertation]. Brunel University; 2016. Available from: http://bura.brunel.ac.uk/handle/2438/12852 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.687669


Universidade do Rio Grande do Sul

18. Luizelli, Marcelo Caggiani. Uma abordagem baseada em aspectos topológicos para expansão de redes físicas no contexto de virtualização de redes.

Degree: 2014, Universidade do Rio Grande do Sul

A virtualização de redes é um mecanismo que permite a coexistência de múltiplas redes virtuais sobre um mesmo substrato físico. Um dos desafios de pesquisa… (more)

Subjects/Keywords: Redes : Computadores; Network virtualization; Redes virtuais; Virtual network embedding problem; Future internet; Planning network capacity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Luizelli, M. C. (2014). Uma abordagem baseada em aspectos topológicos para expansão de redes físicas no contexto de virtualização de redes. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/97100

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Luizelli, Marcelo Caggiani. “Uma abordagem baseada em aspectos topológicos para expansão de redes físicas no contexto de virtualização de redes.” 2014. Thesis, Universidade do Rio Grande do Sul. Accessed December 12, 2019. http://hdl.handle.net/10183/97100.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Luizelli, Marcelo Caggiani. “Uma abordagem baseada em aspectos topológicos para expansão de redes físicas no contexto de virtualização de redes.” 2014. Web. 12 Dec 2019.

Vancouver:

Luizelli MC. Uma abordagem baseada em aspectos topológicos para expansão de redes físicas no contexto de virtualização de redes. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2014. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/10183/97100.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Luizelli MC. Uma abordagem baseada em aspectos topológicos para expansão de redes físicas no contexto de virtualização de redes. [Thesis]. Universidade do Rio Grande do Sul; 2014. Available from: http://hdl.handle.net/10183/97100

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Manchester

19. Christou, Vasileios. Evolution of a Heterogeneous Hybrid Extreme Learning Machine.

Degree: 2019, University of Manchester

 Hybrid optimization algorithms have gained popularity as it has become apparent there cannot be a universal optimization strategy which is globally more beneficial than any… (more)

Subjects/Keywords: Artificial neural network; Classification problem; Custom neuron; Genetic algorithm; Hybrid extreme learning machine; Regression problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Christou, V. (2019). Evolution of a Heterogeneous Hybrid Extreme Learning Machine. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:321835

Chicago Manual of Style (16th Edition):

Christou, Vasileios. “Evolution of a Heterogeneous Hybrid Extreme Learning Machine.” 2019. Doctoral Dissertation, University of Manchester. Accessed December 12, 2019. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:321835.

MLA Handbook (7th Edition):

Christou, Vasileios. “Evolution of a Heterogeneous Hybrid Extreme Learning Machine.” 2019. Web. 12 Dec 2019.

Vancouver:

Christou V. Evolution of a Heterogeneous Hybrid Extreme Learning Machine. [Internet] [Doctoral dissertation]. University of Manchester; 2019. [cited 2019 Dec 12]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:321835.

Council of Science Editors:

Christou V. Evolution of a Heterogeneous Hybrid Extreme Learning Machine. [Doctoral Dissertation]. University of Manchester; 2019. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:321835


Virginia Tech

20. 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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Lunday, Brian Joseph. “Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods.” 2010. Web. 12 Dec 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 Dec 12]. 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


University of Edinburgh

21. Nelson, Thomas. Wirless Mast Place Application for the Scottish Highlands.

Degree: 2008, University of Edinburgh

 This application attempts to provide wireless service to the maximum number of people with a minimal number of masts. This aim creates a challenge for… (more)

Subjects/Keywords: wireless, multicriteria decision analysis, metaheuristics, viewshed, radio network design problem; GIS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nelson, T. (2008). Wirless Mast Place Application for the Scottish Highlands. (Thesis). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/2453

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Nelson, Thomas. “Wirless Mast Place Application for the Scottish Highlands.” 2008. Thesis, University of Edinburgh. Accessed December 12, 2019. http://hdl.handle.net/1842/2453.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Nelson, Thomas. “Wirless Mast Place Application for the Scottish Highlands.” 2008. Web. 12 Dec 2019.

Vancouver:

Nelson T. Wirless Mast Place Application for the Scottish Highlands. [Internet] [Thesis]. University of Edinburgh; 2008. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/1842/2453.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nelson T. Wirless Mast Place Application for the Scottish Highlands. [Thesis]. University of Edinburgh; 2008. Available from: http://hdl.handle.net/1842/2453

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Texas A&M University

22. Wang, Xinghua. Discrete Optimization and Agent-Based Simulation for Regional Evacuation Network Design Problem.

Degree: 2012, Texas A&M University

 Natural disasters and extreme events are often characterized by their violence and unpredictability, resulting in consequences that in severe cases result in devastating physical and… (more)

Subjects/Keywords: Multi-agent Simulation; Network Design; Discrete Optimization; Regional Evacuation Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, X. (2012). Discrete Optimization and Agent-Based Simulation for Regional Evacuation Network Design Problem. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/148251

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wang, Xinghua. “Discrete Optimization and Agent-Based Simulation for Regional Evacuation Network Design Problem.” 2012. Thesis, Texas A&M University. Accessed December 12, 2019. http://hdl.handle.net/1969.1/148251.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wang, Xinghua. “Discrete Optimization and Agent-Based Simulation for Regional Evacuation Network Design Problem.” 2012. Web. 12 Dec 2019.

Vancouver:

Wang X. Discrete Optimization and Agent-Based Simulation for Regional Evacuation Network Design Problem. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/1969.1/148251.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang X. Discrete Optimization and Agent-Based Simulation for Regional Evacuation Network Design Problem. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/148251

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


IUPUI

23. Zhang, Chenfeng. Brain Connectome Network Properties Visualization.

Degree: 2018, IUPUI

Indiana University-Purdue University Indianapolis (IUPUI)

Brain connectome network visualization could help the neurologists inspect the brain structure easily and quickly. In the thesis, the model… (more)

Subjects/Keywords: Network properties visualization; Hypergraph visualization; Traveling salesman problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, C. (2018). Brain Connectome Network Properties Visualization. (Thesis). IUPUI. Retrieved from http://hdl.handle.net/1805/17924

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Zhang, Chenfeng. “Brain Connectome Network Properties Visualization.” 2018. Thesis, IUPUI. Accessed December 12, 2019. http://hdl.handle.net/1805/17924.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Zhang, Chenfeng. “Brain Connectome Network Properties Visualization.” 2018. Web. 12 Dec 2019.

Vancouver:

Zhang C. Brain Connectome Network Properties Visualization. [Internet] [Thesis]. IUPUI; 2018. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/1805/17924.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang C. Brain Connectome Network Properties Visualization. [Thesis]. IUPUI; 2018. Available from: http://hdl.handle.net/1805/17924

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of South Florida

24. Oliveira, Diogo. Multi-Objective Resource Provisioning in Network Function Virtualization Infrastructures.

Degree: 2018, University of South Florida

Network function virtualization (NFV) and software-dened networking (SDN) are two recent networking paradigms that strive to increase manageability, scalability, pro- grammability and dynamism. The former… (more)

Subjects/Keywords: placement problem; risk-aware; virtual network function; Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oliveira, D. (2018). Multi-Objective Resource Provisioning in Network Function Virtualization Infrastructures. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/7206

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Oliveira, Diogo. “Multi-Objective Resource Provisioning in Network Function Virtualization Infrastructures.” 2018. Thesis, University of South Florida. Accessed December 12, 2019. https://scholarcommons.usf.edu/etd/7206.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Oliveira, Diogo. “Multi-Objective Resource Provisioning in Network Function Virtualization Infrastructures.” 2018. Web. 12 Dec 2019.

Vancouver:

Oliveira D. Multi-Objective Resource Provisioning in Network Function Virtualization Infrastructures. [Internet] [Thesis]. University of South Florida; 2018. [cited 2019 Dec 12]. Available from: https://scholarcommons.usf.edu/etd/7206.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oliveira D. Multi-Objective Resource Provisioning in Network Function Virtualization Infrastructures. [Thesis]. University of South Florida; 2018. Available from: https://scholarcommons.usf.edu/etd/7206

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of New Mexico

25. Alyusuf, Husain. Solving the Software Defined Network Controller Placement Problem Using Complex Network Analysis.

Degree: Electrical and Computer Engineering, 2015, University of New Mexico

 Software Defined Network (SDN) is a new architectural design for networking that is constructed based on decoupling the control plane from the data plane in… (more)

Subjects/Keywords: Complex Network; Centrality; SDN; SDN Controller; SDN Placement Problem; GENI; Internet2

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alyusuf, H. (2015). Solving the Software Defined Network Controller Placement Problem Using Complex Network Analysis. (Masters Thesis). University of New Mexico. Retrieved from http://hdl.handle.net/1928/30315

Chicago Manual of Style (16th Edition):

Alyusuf, Husain. “Solving the Software Defined Network Controller Placement Problem Using Complex Network Analysis.” 2015. Masters Thesis, University of New Mexico. Accessed December 12, 2019. http://hdl.handle.net/1928/30315.

MLA Handbook (7th Edition):

Alyusuf, Husain. “Solving the Software Defined Network Controller Placement Problem Using Complex Network Analysis.” 2015. Web. 12 Dec 2019.

Vancouver:

Alyusuf H. Solving the Software Defined Network Controller Placement Problem Using Complex Network Analysis. [Internet] [Masters thesis]. University of New Mexico; 2015. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/1928/30315.

Council of Science Editors:

Alyusuf H. Solving the Software Defined Network Controller Placement Problem Using Complex Network Analysis. [Masters Thesis]. University of New Mexico; 2015. Available from: http://hdl.handle.net/1928/30315


University of New South Wales

26. Duell, Melissa. Strategic Traffic Assignment: Models and Applications to Capture Day-to-Day Flow Volatility.

Degree: Civil & Environmental Engineering, 2015, University of New South Wales

 Traffic assignment models continue to play a critical role in the transportation planning process. Furthermore, day-to-day traffic flow volatility is a well-acknowledged phenomenon that planners… (more)

Subjects/Keywords: Traffic network design problem; Traffic assignment; Uncertainty in modelling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duell, M. (2015). Strategic Traffic Assignment: Models and Applications to Capture Day-to-Day Flow Volatility. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/54800 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:35952/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Duell, Melissa. “Strategic Traffic Assignment: Models and Applications to Capture Day-to-Day Flow Volatility.” 2015. Doctoral Dissertation, University of New South Wales. Accessed December 12, 2019. http://handle.unsw.edu.au/1959.4/54800 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:35952/SOURCE02?view=true.

MLA Handbook (7th Edition):

Duell, Melissa. “Strategic Traffic Assignment: Models and Applications to Capture Day-to-Day Flow Volatility.” 2015. Web. 12 Dec 2019.

Vancouver:

Duell M. Strategic Traffic Assignment: Models and Applications to Capture Day-to-Day Flow Volatility. [Internet] [Doctoral dissertation]. University of New South Wales; 2015. [cited 2019 Dec 12]. Available from: http://handle.unsw.edu.au/1959.4/54800 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:35952/SOURCE02?view=true.

Council of Science Editors:

Duell M. Strategic Traffic Assignment: Models and Applications to Capture Day-to-Day Flow Volatility. [Doctoral Dissertation]. University of New South Wales; 2015. Available from: http://handle.unsw.edu.au/1959.4/54800 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:35952/SOURCE02?view=true


University of Missouri – Columbia

27. Zheng, Bichen. A distribution network design model based on network splitting.

Degree: 2011, University of Missouri – Columbia

 [ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT AUTHOR'S REQUEST.] In today's market place, logistics have become more important than ever. How to devise an… (more)

Subjects/Keywords: network design; vehicle routing problem; split delivery; operation research; linear programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zheng, B. (2011). A distribution network design model based on network splitting. (Thesis). University of Missouri – Columbia. Retrieved from http://hdl.handle.net/10355/14371

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Zheng, Bichen. “A distribution network design model based on network splitting.” 2011. Thesis, University of Missouri – Columbia. Accessed December 12, 2019. http://hdl.handle.net/10355/14371.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Zheng, Bichen. “A distribution network design model based on network splitting.” 2011. Web. 12 Dec 2019.

Vancouver:

Zheng B. A distribution network design model based on network splitting. [Internet] [Thesis]. University of Missouri – Columbia; 2011. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/10355/14371.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zheng B. A distribution network design model based on network splitting. [Thesis]. University of Missouri – Columbia; 2011. Available from: http://hdl.handle.net/10355/14371

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Cornell University

28. Guo, Xiaotong. SHAREABILITY NETWORK BASED DECOMPOSITION APPROACH FOR SOLVING THE LARGE-SCALE SCHOOL BUS ROUTING PROBLEM .

Degree: 2019, Cornell University

 We consider the classic School Bus Routing Problem (SBRP) combined with alternate modes, where students are either picked up by a fleet of school buses… (more)

Subjects/Keywords: shareability network; Operations research; Transportation; decomposition approach; school bus routing problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guo, X. (2019). SHAREABILITY NETWORK BASED DECOMPOSITION APPROACH FOR SOLVING THE LARGE-SCALE SCHOOL BUS ROUTING PROBLEM . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/67218

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Guo, Xiaotong. “SHAREABILITY NETWORK BASED DECOMPOSITION APPROACH FOR SOLVING THE LARGE-SCALE SCHOOL BUS ROUTING PROBLEM .” 2019. Thesis, Cornell University. Accessed December 12, 2019. http://hdl.handle.net/1813/67218.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Guo, Xiaotong. “SHAREABILITY NETWORK BASED DECOMPOSITION APPROACH FOR SOLVING THE LARGE-SCALE SCHOOL BUS ROUTING PROBLEM .” 2019. Web. 12 Dec 2019.

Vancouver:

Guo X. SHAREABILITY NETWORK BASED DECOMPOSITION APPROACH FOR SOLVING THE LARGE-SCALE SCHOOL BUS ROUTING PROBLEM . [Internet] [Thesis]. Cornell University; 2019. [cited 2019 Dec 12]. Available from: http://hdl.handle.net/1813/67218.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Guo X. SHAREABILITY NETWORK BASED DECOMPOSITION APPROACH FOR SOLVING THE LARGE-SCALE SCHOOL BUS ROUTING PROBLEM . [Thesis]. Cornell University; 2019. Available from: http://hdl.handle.net/1813/67218

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Georgia Tech

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

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

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Altner DS. Advancements on problems involving maximum flows. [Internet] [Doctoral dissertation]. Georgia Tech; 2008. [cited 2019 Dec 12]. 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

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

Degree: 2016, National University of Singapore

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

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

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4] [5] … [960]

.