Kelly M. Sullivan
Affiliation confirmed via AI analysis of OpenAlex, ORCID, and web sources.
Assistant Professor
Formerly Arkansas Affiliated with University of Arkansas through 2024.
Faculty Researcher
Research Areas
Biomedical Subjects
Links
Biography and Research Information
OverviewAI-generated summary
Kelly M. Sullivan's research focuses on optimization and network reliability, particularly in the context of critical infrastructure and wireless sensor networks. Her work addresses challenges related to post-disruption restoration, exploring risk- and resilience-based approaches under uncertainty. Sullivan has investigated time-based node deployment policies for reliable wireless sensor networks and developed model and solution methods for restoring interdependent critical infrastructure networks. Her publications also include research on the single train shortest route problem and algorithms for the single-cut routing problem in rail yards. Additionally, she has explored methods for estimating the survival signature of networks with multiple component classes.
Sullivan's scholarship metrics include an h-index of 13, with 30 total publications and 460 total citations. She has collaborated with several researchers at the University of Arkansas at Fayetteville, including Haitao Liao and Ashlea Bennett Milburn, with whom she shares multiple publications.
Metrics
- h-index: 13
- Publications: 30
- Citations: 460
Selected Publications
-
Case Article—Optimizing Transportation and Equity in a District Zoning Problem for ORville Public Schools (2024)
-
Case—Optimizing Transportation and Equity in a District Zoning Problem for ORville Public Schools (2024)
-
Time-based redeployment of multi-class nodes for reliable wireless sensor network coverage (2024)
-
An optimization‐based Monte Carlo method for estimating the two‐terminal survival signature of networks with two component classes (2024)
-
Approximate dynamic programming for condition-based node deployment in a wireless sensor network (2023)
-
Algorithms and complexity results for the single-cut routing problem in a rail yard (2023)
-
Model and solution method for mean-risk cost-based post-disruption restoration of interdependent critical infrastructure networks (2022)
-
Informing Post-Disaster Restoration through Modeling Interdependent Agriculture and Transportation Networks (2021)
-
The single train shortest route problem in a railyard (2021)
-
Risk and resilience-based optimal post-disruption restoration for critical infrastructures under uncertainty (2021)
-
Time-Based Node Deployment Policies for Reliable Wireless Sensor Networks (2021)
-
Toolpath planning for multi-gantry additive manufacturing (2020)
-
Modeling interdependencies in infrastructure systems using multi-layered network flows (2020)
-
Tool Path Planning Optimization for Multi-Tool Additive Manufacturing (2019)
-
Approximate Dynamic Programming for Selective Maintenance in Series–Parallel Systems (2019)
Collaboration Network
Top Collaborators
- Time-Based Node Deployment Policies for Reliable Wireless Sensor Networks
- Approximate dynamic programming for condition-based node deployment in a wireless sensor network
- Risk and resilience-based optimal post-disruption restoration for critical infrastructures under uncertainty
- Model and solution method for mean-risk cost-based post-disruption restoration of interdependent critical infrastructure networks
- Risk and resilience-based optimal post-disruption restoration for critical infrastructures under uncertainty
- Model and solution method for mean-risk cost-based post-disruption restoration of interdependent critical infrastructure networks
- An optimization‐based Monte Carlo method for estimating the two‐terminal survival signature of networks with two component classes
- Time-based redeployment of multi-class nodes for reliable wireless sensor network coverage
- Case—Optimizing Transportation and Equity in a District Zoning Problem for ORville Public Schools
- Case Article—Optimizing Transportation and Equity in a District Zoning Problem for ORville Public Schools
- The single train shortest route problem in a railyard
- The single train shortest route problem in a railyard
- Informing Post-Disaster Restoration through Modeling Interdependent Agriculture and Transportation Networks
- Informing Post-Disaster Restoration through Modeling Interdependent Agriculture and Transportation Networks
- Informing Post-Disaster Restoration through Modeling Interdependent Agriculture and Transportation Networks
- Informing Post-Disaster Restoration through Modeling Interdependent Agriculture and Transportation Networks
- Informing Post-Disaster Restoration through Modeling Interdependent Agriculture and Transportation Networks
- Informing Post-Disaster Restoration through Modeling Interdependent Agriculture and Transportation Networks
- Informing Post-Disaster Restoration through Modeling Interdependent Agriculture and Transportation Networks
- Algorithms and complexity results for the single-cut routing problem in a rail yard
Similar Researchers
Based on overlapping research topics