default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDR. Kevin Wood
Person information
- affiliation: Operations Research Department, Naval Postgraduate School in Monterey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j26]David L. Alderson, Gerald G. Brown, W. Matthew Carlyle, R. Kevin Wood:
Assessing and Improving the Operational Resilience of a Large Highway Infrastructure System to Worst-Case Losses. Transp. Sci. 52(4): 1012-1034 (2018)- 2017
- [j25]Javier Salmerón, R. Kevin Wood:
Game-theoretic methods for locating camera towers and scheduling surveillance. Int. J. Simul. Process. Model. 12(3/4): 264-273 (2017) - 2016
- [j24]Thomas W. M. Vossen, R. Kevin Wood, Alexandra M. Newman:
Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing. Oper. Res. 64(4): 771-793 (2016) - [j23]D. Antony Tarvin, R. Kevin Wood, Alexandra M. Newman:
Benders decomposition: Solving binary master problems by enumeration. Oper. Res. Lett. 44(1): 80-85 (2016) - 2013
- [j22]Christopher Cullenbine, R. Kevin Wood
, Alexandra M. Newman:
Theoretical and computational advances for network diversion. Networks 62(3): 225-242 (2013) - 2011
- [j21]Ibrahim Akgün, Barbaros Ç. Tansel, R. Kevin Wood:
The multi-terminal maximum-flow network-interdiction problem. Eur. J. Oper. Res. 211(2): 241-251 (2011) - [j20]Christopher Cullenbine, R. Kevin Wood, Alexandra M. Newman:
A sliding time window heuristic for open pit mine block sequencing. Optim. Lett. 5(3): 365-377 (2011) - 2009
- [j19]Gerald G. Brown, W. Matthew Carlyle, Robert C. Harney, Eric M. Skroch, R. Kevin Wood:
Interdicting a Nuclear-Weapons Project. Oper. Res. 57(4): 866-877 (2009) - [j18]Kavinesh J. Singh, Andrew B. Philpott, R. Kevin Wood:
Dantzig-Wolfe Decomposition for Solving Multistage Stochastic Capacity-Planning Problems. Oper. Res. 57(5): 1271-1286 (2009) - 2008
- [j17]W. Matthew Carlyle, Johannes O. Royset, R. Kevin Wood:
Lagrangian relaxation and enumeration for solving constrained shortest-path problems. Networks 52(4): 256-270 (2008) - 2007
- [j16]Johannes O. Royset, R. Kevin Wood:
Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem. INFORMS J. Comput. 19(2): 175-184 (2007) - 2006
- [j15]Gerald G. Brown, W. Matthew Carlyle, Javier Salmerón, R. Kevin Wood:
Defending Critical Infrastructure. Interfaces 36(6): 530-544 (2006) - [j14]Eduardo F. Silva, R. Kevin Wood:
Solving a class of stochastic mixed-integer programs with branch and price. Math. Program. 108(2-3): 395-418 (2006) - 2005
- [j13]Gerald G. Brown, W. Matthew Carlyle, Douglas Diehl, Jeffrey E. Kline, R. Kevin Wood:
A Two-Sided Optimization for Theater Ballistic Missile Defense. Oper. Res. 53(5): 745-763 (2005) - [j12]W. Matthew Carlyle, R. Kevin Wood:
Near-shortest and K-shortest simple paths. Networks 46(2): 98-109 (2005) - 2002
- [j11]Eitan Israeli, R. Kevin Wood:
Shortest-path network interdiction. Networks 40(2): 97-111 (2002) - 1999
- [j10]David P. Morton, R. Kevin Wood:
Restricted-Recourse Bounds for Stochastic Linear Programming. Oper. Res. 47(6): 943-956 (1999) - [j9]Wai-Kei Mak, David P. Morton, R. Kevin Wood:
Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper. Res. Lett. 24(1-2): 47-56 (1999) - 1998
- [j8]Kelly J. Cormican, David P. Morton, R. Kevin Wood:
Stochastic Network Interdiction. Oper. Res. 46(2): 184-197 (1998) - 1996
- [j7]Appajosyula Satyanarayana, R. Kevin Wood, Leonidas Camarinopoulos, G. Pampoukis:
Note on "A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network". SIAM J. Comput. 25(2): 290 (1996) - 1992
- [j6]William Avery, Gerald G. Brown, John A. Rosenkranz, R. Kevin Wood:
Optimization of Purchase, Storage and Transmission Contracts for Natural Gas Utilities. Oper. Res. 40(3): 446-462 (1992) - 1990
- [j5]Gerald G. Brown, Clark E. Goodman, R. Kevin Wood:
Annual Scheduling of Atlantic Fleet Naval Combatants. Oper. Res. 38(2): 249-259 (1990) - 1989
- [j4]R. Kevin Wood:
Triconnected decomposition for computing K-terminal network reliability. Networks 19(2): 203-220 (1989) - 1985
- [j3]Gerald G. Brown, Richard D. McBride, R. Kevin Wood:
Extracting embedded generalized networks from linear programming problems. Math. Program. 32(1): 11-31 (1985) - [j2]R. Kevin Wood:
A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability. Networks 15(2): 173-190 (1985) - [j1]Appajosyula Satyanarayana, R. Kevin Wood:
A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks. SIAM J. Comput. 14(4): 818-832 (1985)
Conference and Workshop Papers
- 2011
- [c3]Christopher Cullenbine, R. Kevin Wood, Alexandra M. Newman:
New Results for the Directed Network Diversion Problem. CTW 2011: 134-137 - 2006
- [c2]Susan M. Sanchez, R. Kevin Wood:
The "BEST" algorithm for solving stochastic mixed integer programs. WSC 2006: 765-773 - 1987
- [c1]Peter A. W. Lewis, Richard L. Ressler, R. Kevin Wood:
Smarter control variables: regression-adjusted linear and nonlinear controls. WSC 1987: 342-347
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-04-24 23:10 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:
