default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShane G. Henderson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j45]Brian Liu
, Yujia Zhang, Shane G. Henderson, David B. Shmoys, Peter I. Frazier:
Modeling the Risk of In-Person Instruction During the COVID-19 Pandemic. INFORMS J. Appl. Anal. 54(6): 537-552 (2024)- 2023
- [j44]David J. Eckman, Shane G. Henderson, Sara Shashaani:
Diagnostic Tools for Evaluating and Comparing Simulation-Optimization Algorithms. INFORMS J. Comput. 35(2): 350-367 (2023) - [j43]David J. Eckman, Shane G. Henderson, Sara Shashaani:
SimOpt: A Testbed for Simulation-Optimization Experiments. INFORMS J. Comput. 35(2): 495-508 (2023) - [j42]Woo-Hyung Cho, David B. Shmoys, Shane G. Henderson:
SPT optimality (mostly) via linear programming. Oper. Res. Lett. 51(1): 99-104 (2023) - [c57]Shane G. Henderson:
Practical Impact and Academia are not Antonyms. WSC 2023: 16-30 - [c56]David J. Eckman, Shane G. Henderson, Sara Shashaani:
Stochastic Constraints: How Feasible Is Feasible? WSC 2023: 3589-3600 - 2022
- [j41]David J. Eckman, Shane G. Henderson:
Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures. INFORMS J. Comput. 34(3): 1711-1728 (2022) - [j40]Daniel Freund, Shane G. Henderson, David B. Shmoys:
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. Oper. Res. 70(5): 2715-2731 (2022) - [j39]Shane G. Henderson, Pieter L. van den Berg, Caroline J. Jagtenberg, Hemeng Li:
How should volunteers be dispatched to out-of-hospital cardiac arrest cases? Queueing Syst. Theory Appl. 100(3-4): 437-439 (2022) - [c55]Matthew T. Ford, Shane G. Henderson, David J. Eckman:
Automatic Differentiation for Gradient Estimators in Simulation. WSC 2022: 3134-3145 - [i4]Woo-Hyung Cho, Shane G. Henderson, David B. Shmoys:
Scheduling with Predictions. CoRR abs/2212.10433 (2022) - 2021
- [j38]Raj Dandekar, Shane G. Henderson, Hermanus M. Jansen, Joshua McDonald, Sarat Babu Moka, Yoni Nazarathy, Christopher Rackauckas, Peter G. Taylor, Aapeli Vuorinen:
Safe Blues: The case for virtual safe virus spread in the long-term fight against epidemics. Patterns 2(3): 100220 (2021) - [j37]David J. Eckman, Shane G. Henderson:
Fixed-Confidence, Fixed-Tolerance Guarantees for Ranking-and-Selection Procedures. ACM Trans. Model. Comput. Simul. 31(2): 7:1-7:33 (2021) - [c54]Shane G. Henderson:
Reflections On Simulation Optimization. WSC 2021: 1-15 - 2020
- [j36]Nanjing Jian, Shane G. Henderson:
Estimating the Probability that a Function Observed with Noise Is Convex. INFORMS J. Comput. 32(2): 376-389 (2020) - [c53]David J. Eckman, Shane G. Henderson:
Biased Gradient Estimators in Simulation Optimization. WSC 2020: 2935-2946
2010 – 2019
- 2019
- [j35]Daniel Freund, Shane G. Henderson, Eoin O'Mahony, David B. Shmoys:
Analytics and Bikes: Riding Tandem with Motivate to Improve Mobility. INFORMS J. Appl. Anal. 49(5): 310-323 (2019) - [j34]Peter I. Frazier, Shane G. Henderson, Rolf Waeber:
Probabilistic Bisection Converges Almost as Quickly as Stochastic Approximation. Math. Oper. Res. 44(2): 651-667 (2019) - [j33]Sijia Ma, Shane G. Henderson:
Predicting the Simulation Budget in Ranking and Selection Procedures. ACM Trans. Model. Comput. Simul. 29(3): 14:1-14:25 (2019) - [c52]David J. Eckman, Shane G. Henderson, Raghu Pasupathy:
Redesigning a Testbed of Simulation-Optimization Problems and Solvers for Experimental Comparisons. WSC 2019: 3457-3467 - 2018
- [j32]David J. Eckman, Shane G. Henderson:
Reusing Search Data in Ranking and Selection: What Could Possibly Go Wrong? ACM Trans. Model. Comput. Simul. 28(3): 18:1-18:15 (2018) - [c51]David J. Eckman, Shane G. Henderson:
Guarantees on the Probability of Good Selection. WSC 2018: 351-365 - 2017
- [j31]Eric Cao Ni, Dragos Florin Ciocan, Shane G. Henderson, Susan R. Hunter:
Efficient Ranking and Selection in Parallel Computing Environments. Oper. Res. 65(3): 821-836 (2017) - [c50]Daniel Freund, Shane G. Henderson, David B. Shmoys:
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. IPCO 2017: 186-198 - [c49]Michael C. Fu, Shane G. Henderson:
History of seeking better solutions, AKA simulation optimization. WSC 2017: 131-157 - [c48]Naijia Anna Dong, David J. Eckman, Xueqi Zhao, Shane G. Henderson, Matthias Poloczek:
Empirically comparing the finite-time performance of simulation-optimization algorithms. WSC 2017: 2206-2217 - [c47]Sijia Ma, Shane G. Henderson:
An efficient fully sequential selection procedure guaranteeing probably approximately correct selection. WSC 2017: 2225-2236 - [c46]Jeffrey S. Smith, Christos Alexopoulos, Shane G. Henderson, Lee Schruben:
Teaching undergraduate simulation - 4 questions for 4 experienced instructors. WSC 2017: 4264-4275 - [i3]Stephen N. Pallone, Peter I. Frazier, Shane G. Henderson:
Bayes-Optimal Entropy Pursuit for Active Choice-Based Preference Learning. CoRR abs/1702.07694 (2017) - 2016
- [j30]Bradford S. Westgate, Dawn B. Woodard, David S. Matteson, Shane G. Henderson:
Large-network travel time distribution estimation for ambulances. Eur. J. Oper. Res. 252(1): 322-333 (2016) - [j29]Kenneth C. Chong, Shane G. Henderson, Mark E. Lewis:
The Vehicle Mix Decision in Emergency Medical Service Systems. Manuf. Serv. Oper. Manag. 18(3): 347-360 (2016) - [j28]Stephen Pallone, Peter I. Frazier, Shane G. Henderson:
Coupled bisection for root ordering. Oper. Res. Lett. 44(2): 165-169 (2016) - [c45]Nanjing Jian, Daniel Freund, Holly M. Wiberg, Shane G. Henderson:
Simulation optimization for a large-scale bike-sharing system. WSC 2016: 602-613 - [c44]David J. Eckman, Shane G. Henderson:
Challenges in applying ranking and selection after search. WSC 2016: 3684-3685 - [i2]Daniel Freund, Shane G. Henderson, David B. Shmoys:
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. CoRR abs/1611.09304 (2016) - 2015
- [j27]Eric Cao Ni, Shane G. Henderson:
How Hard are Steady-State Queueing Simulations? ACM Trans. Model. Comput. Simul. 25(4): 27:1-27:21 (2015) - [c43]Divya Singhvi, Somya Singhvi, Peter I. Frazier, Shane G. Henderson, Eoin O'Mahony, David B. Shmoys, Dawn B. Woodard:
Predicting Bike Usage for New York City's Bike Sharing System. AAAI Workshop: Computational Sustainability 2015 - [c42]Nanjing Jian, Shane G. Henderson:
An introduction to simulation optimization. WSC 2015: 1780-1794 - [c41]Eric Cao Ni, Dragos Florin Ciocan, Shane G. Henderson, Susan R. Hunter:
Comparing message passing interface and mapreduce for large-scale parallel ranking and selection. WSC 2015: 3858-3867 - [i1]Eric Cao Ni, Dragos Florin Ciocan, Shane G. Henderson, Susan R. Hunter:
Efficient Ranking and Selection in Parallel Computing Environments. CoRR abs/1506.04986 (2015) - 2014
- [j26]Matthew S. Maxwell, Eric Cao Ni, Chaoxu Tong, Shane G. Henderson, Huseyin Topaloglu, Susan R. Hunter:
A Bound on the Performance of an Optimal Ambulance Redeployment Policy. Oper. Res. 62(5): 1014-1027 (2014) - [j25]Peter J. Haas, Shane G. Henderson, Pierre L'Ecuyer:
Guest editors' introduction to special issue on the third INFORMS simulation society research workshop. ACM Trans. Model. Comput. Simul. 24(1): 1:1-1:3 (2014) - [c40]Michael C. Fu, Güzin Bayraksan, Shane G. Henderson, Barry L. Nelson, Warren B. Powell, Ilya O. Ryzhov, Benjamin G. Thengvall:
Simulation optimization: a panel on the state of the art in research and practice. WSC 2014: 3696-3706 - [c39]Eric Cao Ni, Shane G. Henderson, Susan R. Hunter:
A comparison of two parallel ranking and selection procedures. WSC 2014: 3761-3772 - [c38]Stephen Pallone, Peter I. Frazier, Shane G. Henderson:
Multisection: parallelized bisection. WSC 2014: 3773-3784 - [c37]Nanjing Jian, Shane G. Henderson, Susan R. Hunter:
Sequential detection of convexity from noisy function evaluations. WSC 2014: 3892-3903 - 2013
- [j24]Timothy A. Carnes, Shane G. Henderson, David B. Shmoys, Mahvareh Ahghari, Russell D. MacDonald:
Mathematical Programming Guides Air-Ambulance Routing at Ornge. Interfaces 43(3): 232-239 (2013) - [j23]Rolf Waeber, Peter I. Frazier, Shane G. Henderson:
Bisection Search with Noisy Responses. SIAM J. Control. Optim. 51(3): 2261-2279 (2013) - [c36]Eric Cao Ni, Susan R. Hunter, Shane G. Henderson:
Ranking and selection in a high performance computing environment. WSC 2013: 833-845 - 2012
- [j22]Evan A. Saltzman, John H. Drew, Lawrence M. Leemis, Shane G. Henderson:
Simulating Multivariate Nonhomogeneous Poisson Processes Using Projections. ACM Trans. Model. Comput. Simul. 22(3): 15:1-15:13 (2012) - [j21]Rolf Waeber, Peter I. Frazier, Shane G. Henderson:
A Framework for Selecting a Selection Procedure. ACM Trans. Model. Comput. Simul. 22(3): 16:1-16:23 (2012) - [j20]Shane G. Henderson, Samuel Ehrlichman:
Sharpening comparisons via gaussian copulas and semidefinite programming. ACM Trans. Model. Comput. Simul. 22(4): 22:1-22:21 (2012) - [c35]Shane G. Henderson, Sheldon H. Jacobson, Stewart Robinson:
Teaching an advanced simulation topic. WSC 2012: 2:1-2:9 - [c34]Eric Cao Ni, Susan R. Hunter, Shane G. Henderson, Huseyin Topaloglu:
Exploring bounds on ambulance deployment policy performance. WSC 2012: 45:1-45:12 - 2011
- [c33]Rolf Waeber, Peter I. Frazier, Shane G. Henderson:
A Bayesian approach to stochastic root finding. WSC 2011: 4038-4050 - [c32]Raghu Pasupathy, Shane G. Henderson:
SimOpt: a library of simulation optimization problems. WSC 2011: 4080-4090 - 2010
- [j19]Matthew S. Maxwell, Mateo Restrepo, Shane G. Henderson, Huseyin Topaloglu:
Approximate Dynamic Programming for Ambulance Redeployment. INFORMS J. Comput. 22(2): 266-281 (2010) - [c31]Matthew S. Maxwell, Shane G. Henderson, Huseyin Topaloglu:
Identifying effective policies in approximate dynamic programming: Beyond regression. WSC 2010: 1079-1087 - [c30]Rolf Waeber, Peter I. Frazier, Shane G. Henderson:
Performance measures for Ranking and Selection procedures. WSC 2010: 1235-1245
2000 – 2009
- 2009
- [j18]Sergey Gorinsky, Eric J. Friedman, Shane G. Henderson, Christoph Jechlitschek:
Efficient fair algorithms for message communication. Simul. Model. Pract. Theory 17(3): 513-527 (2009) - [j17]Soumyadip Ghosh, Shane G. Henderson:
Corrigendum: Behavior of the NORTA method for correlated random vector generation as the dimension increases. ACM Trans. Model. Comput. Simul. 19(4): 20:1-20:3 (2009) - [c29]Eric J. Friedman, Shane G. Henderson, Thomas Byuen, German Gutierrez Gallardo:
Estimating the Probability that the Game of Monopoly never ends. WSC 2009: 380-391 - [c28]Matthew S. Maxwell, Shane G. Henderson, Huseyin Topaloglu:
Ambulance Redeployment: An Approximate Dynamic Programming Approach. WSC 2009: 1850-1860 - 2008
- [j16]Júlíus Atlason, Marina A. Epelman, Shane G. Henderson:
Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods. Manag. Sci. 54(2): 295-309 (2008) - [c27]Sujin Kim, Shane G. Henderson:
The mathematics of continuous-variable simulation optimization. WSC 2008: 122-132 - [c26]Samuel Ehrlichman, Shane G. Henderson:
Comparing two systems: Beyond common random numbers. WSC 2008: 245-251 - [c25]Shane G. Henderson:
Staying sane on the tenure track. WSC 2008: 2954-2959 - 2007
- [j15]Sujin Kim, Shane G. Henderson:
Adaptive Control Variates for Finite-Horizon Simulation. Math. Oper. Res. 32(3): 508-527 (2007) - [c24]Samuel Ehrlichman, Shane G. Henderson:
Finite-sample performance guarantees for one-dimensional stochastic root finding. WSC 2007: 313-321 - [c23]Sujin Kim, Shane G. Henderson:
Non-linear control variates for regenerative steady-state simulation. WSC 2007: 430-438 - [e2]Shane G. Henderson, Bahar Biller, Ming-Hua Hsieh, John Shortle, Jeffrey D. Tew, Russell R. Barton:
Proceedings of the Winter Simulation Conference, WSC 2007, Washington, DC, USA, December 9-12, 2007. WSC 2007, ISBN 1-4244-1306-0 [contents] - 2006
- [j14]Soumyadip Ghosh, Shane G. Henderson:
Corrigendum: Behavior of the NORTA method for correlated random vector generation as the dimension increases. ACM Trans. Model. Comput. Simul. 16(1): 93-94 (2006) - [c22]Raghu Pasupathy, Shane G. Henderson:
A testbed of simulation-optimization problems. WSC 2006: 255-263 - [c21]Samuel Ehrlichman, Shane G. Henderson:
American options from MARS. WSC 2006: 719-726 - [p3]Shane G. Henderson, Barry L. Nelson:
Chapter 1 Stochastic Computer Simulation. Simulation 2006: 1-18 - [p2]Shane G. Henderson:
Chapter 2 Mathematics for Simulation. Simulation 2006: 19-53 - [p1]Shane G. Henderson, Barry L. Nelson:
Dedication. Simulation 2006: v - [e1]Shane G. Henderson, Barry L. Nelson:
Simulation. Handbooks in Operations Research and Management Science 13, North-Holland 2006, ISBN 978-0-444-51428-8 [contents] - 2005
- [c20]Samuel Ehrlichman, Shane G. Henderson:
Adaptive control variates for American option pricing. WSC 2005: 11 - [c19]Shane G. Henderson:
Should we model dependence and nonstationarity, and if so how? WSC 2005: 120-129 - [c18]Samuel G. Steckley, Shane G. Henderson, Vijay Mehrotra:
Performance measures for service systems with a random arrival rate. WSC 2005: 566-575 - 2004
- [j13]Júlíus Atlason, Marina A. Epelman, Shane G. Henderson:
Call Center Staffing with Simulation and Cutting Plane Methods. Ann. Oper. Res. 127(1-4): 333-358 (2004) - [j12]Andrew B. Philpott, Shane G. Henderson, D. Teirney:
A Simulation Model for Predicting Yacht Match Race Outcomes. Oper. Res. 52(1): 1-16 (2004) - [j11]Jeffrey W. Ohlmann, James C. Bean, Shane G. Henderson:
Convergence in Probability of Compressed Annealing. Math. Oper. Res. 29(4): 837-860 (2004) - [c17]Sujin Kim, Shane G. Henderson:
Adaptive Control Variates. WSC 2004: 621-629 - 2003
- [j10]Shane G. Henderson, Sean P. Meyn, Vladislav B. Tadic:
Performance Evaluation and Policy Selection in Multiclass Networks. Discret. Event Dyn. Syst. 13(1-2): 149-189 (2003) - [j9]Shane G. Henderson, Peter W. Glynn:
Nonexistence of a class of variate generation schemes. Oper. Res. Lett. 31(2): 83-89 (2003) - [j8]Shane G. Henderson:
Estimation for nonhomogeneous Poisson processes from aggregated data. Oper. Res. Lett. 31(3): 375-382 (2003) - [j7]Soumyadip Ghosh, Shane G. Henderson:
Behavior of the NORTA method for correlated random vector generation as the dimension increases. ACM Trans. Model. Comput. Simul. 13(3): 276-294 (2003) - [c16]Eric J. Friedman, Shane G. Henderson:
Fairness and efficiency in web server protocols. SIGMETRICS 2003: 229-237 - [c15]Shane G. Henderson:
Input modeling: input model uncertainty: why do we care and what should we do about it? WSC 2003: 90-100 - [c14]Samuel G. Steckley, Shane G. Henderson:
Simulation input modeling: a kernel approach to estimating the density of a conditional expectation. WSC 2003: 383-391 - [c13]Júlíus Atlason, Marina A. Epelman, Shane G. Henderson:
Customer relations management: service operations: using simulation to approximate subgradients of convex performance measures in service systems. WSC 2003: 1824-1832 - 2002
- [j6]Soumyadip Ghosh, Shane G. Henderson:
Chessboard Distributions and Random Vectors with Specified Marginals and Covariance Matrix. Oper. Res. 50(5): 820-834 (2002) - [j5]Shane G. Henderson, Peter W. Glynn:
Approximating Martingales for Variance Reduction in Markov Process Simulation. Math. Oper. Res. 27(2): 253-271 (2002) - [c12]Soumyadip Ghosh, Shane G. Henderson:
Advanced input modeling: properties of the NORTA method in higher dimensions. WSC 2002: 263-269 - [c11]Russell R. Barton, Stephen E. Chick, Russell C. H. Cheng, Shane G. Henderson, Averill M. Law, Bruce W. Schmeiser, Lawrence M. Leemis, Lee Schruben, James R. Wilson:
Panel discussion on current issues in input modeling: panel on current issues in simulation input modeling. WSC 2002: 353-369 - 2001
- [j4]Bert P. K. Chen, Shane G. Henderson:
Two Issues in Setting Call Centre Staffing Levels. Ann. Oper. Res. 108(1-4): 175-192 (2001) - [j3]Shane G. Henderson, Peter W. Glynn:
Computing Densities for Markov Chains via Simulation. Math. Oper. Res. 26(2): 375-400 (2001) - [j2]Shane G. Henderson, Peter W. Glynn:
Regenerative steady-state simulation of discrete-event systems. ACM Trans. Model. Comput. Simul. 11(4): 313-345 (2001) - [c10]Shane G. Henderson:
Simulation mathematics and random number generation: mathematics for simulation. WSC 2001: 83-94 - [c9]Soumyadip Ghosh, Shane G. Henderson:
Chessboard distributions. WSC 2001: 385-393 - 2000
- [c8]Shane G. Henderson:
Mathematics and hybrid modeling: mathematics for simulation. WSC 2000: 137-146 - [c7]Shane G. Henderson, Belinda A. Chiera, Roger M. Cooke:
Generating "dependent" quasi-random numbers. WSC 2000: 527-536
1990 – 1999
- 1999
- [j1]Shane G. Henderson, Peter W. Glynn:
Derandomizing Variance Estimators. Oper. Res. 47(6): 907-916 (1999) - [c6]Shane G. Henderson, Peter W. Glynn:
Can the regenerative method be applied to discrete-event simulation? WSC 1999: 367-373 - [c5]Shane G. Henderson, Andrew J. Mason:
Estimating ambulance requirements in Auckland, New Zealand. WSC 1999: 1670-1674 - 1998
- [c4]Peter W. Glynn, Shane G. Henderson:
Estimation of Stationary Densities for Markov Chains. WSC 1998: 647-652 - [c3]Shane G. Henderson, Andrew J. Mason:
Rostering by Iterating Integer Programming and Simulation. WSC 1998: 677-684 - 1997
- [c2]Halim Damerdji, Shane G. Henderson, Peter W. Glynn:
Computational Efficiency Evaluation in Output Analysis. WSC 1997: 208-215 - [c1]Shane G. Henderson, Sean P. Meyn:
Efficient Simulation of Multiclass Queueing Networks. WSC 1997: 216-223
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 2025-01-13 01:05 CET 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:
