default search action
Kelly M. Sullivan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Nayan Chakrabarty, Kelly M. Sullivan
, Daniel B. Lopes da Silva
Time-based redeployment of multi-class nodes for reliable wireless sensor network coverage. Comput. Ind. Eng. 197: 110549 (2024) - [j15]Nicholas T. Boardman
Approximate dynamic programming for condition-based node deployment in a wireless sensor network. Reliab. Eng. Syst. Saf. 243: 109803 (2024) - 2022
- [j14]Basem Alkhaleel
Model and solution method for mean-risk cost-based post-disruption restoration of interdependent critical infrastructure networks. Comput. Oper. Res. 144: 105812 (2022) - [j13]Basem Alkhaleel
Risk and resilience-based optimal post-disruption restoration for critical infrastructures under uncertainty. Eur. J. Oper. Res. 296(1): 174-202 (2022) - 2021
- [j12]Hieu Bui, Harry A. Pierson
Toolpath planning for multi-gantry additive manufacturing. IISE Trans. 53(5): 552-567 (2021) - [j11]Mina Aliakbari, Joseph Geunes
The single train shortest route problem in a railyard. Optim. Lett. 15(8): 2577-2595 (2021) - [j10]Nicholas T. Boardman
Time-Based Node Deployment Policies for Reliable Wireless Sensor Networks. IEEE Trans. Reliab. 70(3): 1204-1217 (2021) - 2020
- [j9]Negin Enayaty Ahangar
Modeling interdependencies in infrastructure systems using multi-layered network flows. Comput. Oper. Res. 117: 104883 (2020) - [j8]Cesar Ruiz, Mohammadhossein Heydari, Kelly M. Sullivan, Haitao Liao, Edward A. Pohl:
Data analysis and resource allocation in Bayesian selective accelerated reliability growth. IISE Trans. 52(3): 301-320 (2020) - [j7]Khatereh Ahadi
Approximate Dynamic Programming for Selective Maintenance in Series-Parallel Systems. IEEE Trans. Reliab. 69(3): 1147-1164 (2020)
2010 – 2019
- 2019
- [j6]N. Orkun Baycik, Kelly M. Sullivan
Robust location of hidden interdictions on a shortest path network. IISE Trans. 51(12): 1332-1347 (2019) - [j5]Cesar Ruiz, Edward A. Pohl, Haitao Liao, Kelly M. Sullivan
A Bayesian framework for accelerated reliability growth testing with multiple sources of uncertainty. Qual. Reliab. Eng. Int. 35(3): 837-853 (2019) - [j4]Mohammadhossein Heydari
Robust allocation of testing resources in reliability growth. Reliab. Eng. Syst. Saf. 192: 106020 (2019) - 2018
- [j3]Mohammadhossein Heydari, Kelly M. Sullivan
An integrated approach to redundancy allocation and test planning for reliability growth. Comput. Oper. Res. 92: 182-193 (2018) - 2014
- [j2]Kelly M. Sullivan
Convex hull representation of the deterministic bipartite network interdiction problem. Math. Program. 145(1-2): 349-376 (2014) - [j1]Kelly M. Sullivan
Exact algorithms for solving a Euclidean maximum flow network interdiction problem. Networks 64(2): 109-124 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: