Theses and Dissertations
Now showing items 1-10 of 37
THE DISTANCE CENTRALITY: MEASURING STRUCTURAL DISRUPTION OF A NETWORK
(Monterey, CA; Naval Postgraduate School, 2018-06)
This research provides an innovative approach to identifying the influence of vertices on the topology of a graph by introducing and exploring the neighbor matrix and distance centrality. The neighbor matrix depicts the ...
Tri-level optimization algorithms for solving defender-attacker- defender network models
(Monterey, California: Naval Postgraduate School, 2016-06)
The optimal defense and operation of networks against worst-case attack is an important problem for military analysts. We review development of existing solutions for the Defender-Attacker-Defender (DAD) tri-level optimization ...
Graph-theoretic statistical methods for detecting and localizing distributional change in multivariate data
(Monterey, California: Naval Postgraduate School, 2015-06)
This dissertation explores the topic of detecting and localizing change in a series of multivariate data using graph-theoretic statistical criteria. Change-detection methods based on graph theory are emerging due to their ...
Superquantile regression: theory, algorithms, and applications
(Monterey, California: Naval Postgraduate School, 2014-12)
We present a novel regression framework centered on a coherent and averse measure of risk, the superquantile risk (also called conditional value-at-risk), which yields more conservatively fitted curves than classical least ...
Network design for reliability and resilience to attack
(Monterey, California: Naval Postgraduate School, 2014-03)
We define and solve two network-design problems. In the first, (1) a defender uses limited resources to select a portfolio of paths or design a sub-network; (2) an attacker then uses limited attack resources to destroy ...
Optimal patrol to detect attacks at dispersed heterogeneous locations
(Monterey, California. Naval Postgraduate School, 2013-12)
We study a patrol problem where several patrollers move between heterogeneous locations dispersed throughout an area of interest in order to detect enemy attacks. To formulate an e ective patrol policy, the patrollers ...
A generalized orienteering problem for optimal search and interdiction planning
(Monterey, California: Naval Postgraduate School, 2013-09)
In order to support search planning for counterdrug operations, we introduce a generalized Orienteering Problem (OP) where transit on arcs in a network and reward collection at nodes both consume a variable amount of the ...
Optimal search for moving targets in continuous time and space using consistent approximations
(Monterey, California. Naval Postgraduate School, 2011-09)
We show how to formulate many continuous time-and-space search problems as generalized optimal control problems, where multiple searchers look for multiple targets. Speci cally, we formulate problems in which we minimize ...
On algorithms for nonlinear minimax and min-max-min problems and their efficiency
(Monterey, California. Naval Postgraduate School, 2011-03)
This dissertation approaches the solution of optimization models with uncertain parameters by considering the worst-case value of the uncertain parameters during optimization. We consider three problems resulting from this ...
Applications of assignment algorithms to nonparametric tests for homogeneity
(Monterey, California: Naval Postgraduate School, 2009-09)
We propose new nonparametric statistical tests to identify whether each element in a sequence of independent multivariate observations is drawn from a common probability distribution or if some distributional change has ...
Branch Of Service
Operations Research (37)