


default search action
Zelda B. Zabinsky
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j41]Chelsea Greene
, Zelda B. Zabinsky, David Sarley, Laila Akhlaghi:
Inventory and order management for healthcare commodities during a pandemic. Ann. Oper. Res. 337(1): 105-133 (2024) - [j40]Seksan Kiatsupaibul, Giulia Pedrielli
, Christopher Thomas Ryan
, Robert L. Smith
, Zelda B. Zabinsky
:
Monte Carlo Fictitious Play for Finding Pure Nash Equilibria in Identical Interest Games. INFORMS J. Optim. 6(3-4): 155-172 (2024) - [c24]Cherry Y. Wakayama, Randall S. Plate, Danielle F. Morey, Zelda B. Zabinsky:
Designing a Communication Relay Network for Multi-Domain Maritime Operations. MILCOM 2024: 481-486 - [c23]Danielle F. Morey, Giulia Pedrielli, Zelda B. Zabinsky:
A Hybrid Approach Combining Simulation and a Queueing Model for Optimizing a Biomanufacturing System. WSC 2024: 1130-1138 - 2023
- [j39]Zelda B. Zabinsky
, David D. Linz:
Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise. J. Glob. Optim. 87(1): 31-55 (2023) - [c22]Serin Lee, Pariyakorn Maneekul, Zelda B. Zabinsky:
Representative Calibration Using Black-Box Optimization and Clustering. WSC 2023: 3669-3680 - 2022
- [c21]Hao Huang, Pariyakorn Maneekul, Danielle F. Morey, Zelda B. Zabinsky, Giulia Pedrielli
:
A Computational Study of Probabilistic Branch and Bound with Multilevel Importance Sampling. WSC 2022: 3251-3262 - 2021
- [j38]Larissa P. G. Petroianu
, Zelda B. Zabinsky
, Mariam Zameer
, Yi Chu, Mamiza M. Muteia, Mauricio G. C. Resende
, Aida L. Coelho, Jiarui Wei, Turam Purty, Abel Draiva, Alvaro Lopes:
A light-touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique. Int. Trans. Oper. Res. 28(5): 2334-2358 (2021) - [j37]Logan Mathesen, Giulia Pedrielli
, Szu Hui Ng, Zelda B. Zabinsky:
Stochastic optimization with adaptive restart: a framework for integrated local and global learning. J. Glob. Optim. 79(1): 87-110 (2021) - [c20]Giulia Pedrielli
, Hao Huang, Zelda B. Zabinsky:
Using Gaussian Processes to Automate Probabilistic Branch & Bound for Global Optimization. CASE 2021: 2276-2281 - [c19]Danielle F. Morey, Zelda B. Zabinsky, Cherry Wakayama, Randall Plate:
Multi-Fidelity Modeling For The Design Of A Maritime Environmental Survey Network Utilizing Unmanned Underwater Vehicles. WSC 2021: 1-12 - 2020
- [j36]Zelda B. Zabinsky
, Pattamon Dulyakupt
, Shabnam Zangeneh-Khamooshi, Cao Xiao, Pengbo Zhang, Seksan Kiatsupaibul, Joseph A. Heim:
Optimal collection of medical specimens and delivery to central laboratory. Ann. Oper. Res. 287(1): 537-564 (2020) - [j35]Seksan Kiatsupaibul, Robert L. Smith, Zelda B. Zabinsky:
Single observation adaptive search for discrete and continuous stochastic optimization. Oper. Res. Lett. 48(5): 666-673 (2020) - [j34]Philip Charles Placek
, Wolf Kohn, Zelda B. Zabinsky:
An I-frame Methodology for Approximating Nonlinear Least Squares. IEEE Trans. Syst. Man Cybern. Syst. 50(4): 1362-1371 (2020) - [j33]Wolf Kohn, Philip Charles Placek
, Zelda B. Zabinsky, Jonathan Cross:
An Incremental Probability Model for Dynamic Systems. IEEE Trans. Syst. Man Cybern. Syst. 50(6): 2083-2092 (2020)
2010 – 2019
- 2019
- [j32]Ting-Yu Ho, Shan Liu, Zelda B. Zabinsky:
A branch and bound algorithm for dynamic resource allocation in population disease management. Oper. Res. Lett. 47(6): 579-586 (2019) - [c18]Zelda B. Zabinsky, Ting-Yu Ho, Hao Huang:
Integrating Heuristics and Approximations into a Branch and Bound Framework*. CASE 2019: 774-779 - [c17]Zelda B. Zabinsky
, Giulia Pedrielli
, Hao Huang
:
A Framework for Multi-fidelity Modeling in Global Optimization Approaches. LOD 2019: 335-346 - 2018
- [j31]Rachel St. John, Sándor F. Tóth
, Zelda B. Zabinsky
:
Optimizing the Geometry of Wildlife Corridors in Conservation Reserve Design. Oper. Res. 66(6): 1471-1485 (2018) - [j30]Seksan Kiatsupaibul
, Robert L. Smith
, Zelda B. Zabinsky
:
Single Observation Adaptive Search for Continuous Simulation Optimization. Oper. Res. 66(6): 1713-1727 (2018) - [c16]Yi-An Tsai, Giulia Pedrielli
, Logan Mathesen, Zelda B. Zabinsky, Hao Huang, Antonio Candelieri, Riccardo Perego:
Stochastic Optimization for Feasibility determination: an Application to water pump Operation in water Distribution Network. WSC 2018: 1945-1956 - 2017
- [j29]Paveena Chaovalitwongse, Krongsin Somprasonk, Naragain Phumchusri, Joseph A. Heim, Zelda B. Zabinsky, W. Art Chaovalitwongse:
A decision support model for staff allocation of mobile medical service. Ann. Oper. Res. 249(1-2): 433-448 (2017) - [c15]David D. Linz, Zelda B. Zabinsky, Seksan Kiatsupaibul, Robert L. Smith:
A computational comparison of simulation optimization methods using single observations within a shrinking ball on noisy black-box functions with mixed integer and continuous domains. WSC 2017: 2045-2056 - [c14]David D. Linz, Hao Huang, Zelda B. Zabinsky:
Multi-fidelity simulation optimization with level set approximation using probabilistic branch and bound. WSC 2017: 2057-2068 - [i1]Peeyush Kumar, Wolf Kohn, Zelda B. Zabinsky:
Near Optimal Hamiltonian-Control and Learning via Chattering. CoRR abs/1703.06485 (2017) - 2016
- [j28]Seksan Kiatsupaibul, Robert L. Smith, Zelda B. Zabinsky:
Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem. J. Glob. Optim. 66(4): 711-727 (2016) - [c13]David D. Linz, Hao Huang, Zelda B. Zabinsky:
A quantile-based nested partition algorithm for black-box functions on a continuous domain. WSC 2016: 638-648 - [c12]Ting-Yu Ho, Paul A. Fishman, Zelda B. Zabinsky:
Designing and analyzing healthcare insurance policies to reduce cost and prevent the spread of seasonal influenza. WSC 2016: 2018-2029 - [c11]Hao Huang, Zelda B. Zabinsky, Yuankun Li, Shan Liu:
Analyzing hepatitis C screening and treatment strategies using Probabilistic Branch and Bound. WSC 2016: 2076-2086 - 2015
- [j27]Wolf Kohn, Zelda B. Zabinsky, Anil Nerode:
A Micro-Grid Distributed Intelligent Control and Management System. IEEE Trans. Smart Grid 6(6): 2964-2974 (2015) - [c10]Seksan Kiatsupaibul, Robert L. Smith, Zelda B. Zabinsky:
Improving hit-and-run with single observations for continuous simulation optimization. WSC 2015: 3569-3576 - [c9]David D. Linz, Hao Huang, Zelda B. Zabinsky:
Partition based optimization for updating sample allocation strategy using lookahead. WSC 2015: 3577-3588 - [c8]Cherry Y. Wakayama, Zelda B. Zabinsky:
Simulation-driven task prioritization using a restless bandit model for active sonar missions. WSC 2015: 3725-3736 - 2014
- [j26]Huseyin Onur Mete, Zelda B. Zabinsky:
Multiobjective Interacting Particle Algorithm for Global Optimization. INFORMS J. Comput. 26(3): 500-513 (2014) - [c7]Hao Huang, Zelda B. Zabinsky:
Multiple objective probabilistic branch and bound for pareto optimal approximation. WSC 2014: 3916-3927 - 2013
- [j25]Pengbo Zhang, Wolf Kohn, Zelda B. Zabinsky:
A Discrete Meta-Control Procedure for Approximating Solutions to Binary Programs. Entropy 15(9): 3592-3601 (2013) - [j24]Shabnam Zangeneh-Khamooshi, Zelda B. Zabinsky, Joseph A. Heim:
A multi-shift vehicle routing problem with windows and cycle times. Optim. Lett. 7(6): 1215-1225 (2013) - [c6]Hao Huang, Zelda B. Zabinsky:
Adaptive probabilistic branch and bound with confidence intervals for level set approximation. WSC 2013: 980-991 - 2012
- [j23]Huseyin Onur Mete, Zelda B. Zabinsky:
Pattern Hit-and-Run for sampling efficiently on polytopes. Oper. Res. Lett. 40(1): 6-11 (2012) - [c5]Cherry Wakayama, Zelda B. Zabinsky, Doug J. Grimmett:
Linear optimization models with integer solutions for ping control problems in multistatic active acoustic networks. FUSION 2012: 2354-2361 - 2011
- [j22]Huseyin Onur Mete, Yanfang Shen, Zelda B. Zabinsky, Seksan Kiatsupaibul, Robert L. Smith:
Pattern discrete and mixed Hit-and-Run for global optimization. J. Glob. Optim. 50(4): 597-627 (2011) - [j21]Seksan Kiatsupaibul, Robert L. Smith, Zelda B. Zabinsky:
An analysis of a variation of hit-and-run for uniform sampling from general regions. ACM Trans. Model. Comput. Simul. 21(3): 16:1-16:11 (2011) - [c4]Cherry Wakayama, Doug J. Grimmett, Zelda B. Zabinsky:
Forecasting probability of target presence for ping control in multistatic sonar networks using detection and tracking models. FUSION 2011: 1-8 - [c3]Zelda B. Zabinsky, Wei Wang, Yanto Prasetio, Archis Ghate, Joyce W. Yen:
Adaptive probabilistic branch and bound for level set approximation. WSC 2011: 4151-4162 - 2010
- [j20]Zelda B. Zabinsky, David W. Bulger
, Charoenchai Khompatraporn:
Stopping and restarting strategy for stochastic sequential search in global optimization. J. Glob. Optim. 46(2): 273-286 (2010)
2000 – 2009
- 2009
- [j19]Stephen Baumert, Archis Ghate, Seksan Kiatsupaibul, Yanfang Shen, Robert L. Smith, Zelda B. Zabinsky:
Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles. Oper. Res. 57(3): 727-739 (2009) - [j18]Orcun Molvalioglu, Zelda B. Zabinsky, Wolf Kohn:
The interacting-particle algorithm with dynamic heating and cooling. J. Glob. Optim. 43(2-3): 329-356 (2009) - [j17]Wei Wang, Archis Ghate, Zelda B. Zabinsky:
Adaptive parameterized improving hit-and-run for global optimization. Optim. Methods Softw. 24(4-5): 569-594 (2009) - [r2]Zelda B. Zabinsky:
Global Optimization: Hit and Run Methods. Encyclopedia of Optimization 2009: 1342-1346 - [r1]Zelda B. Zabinsky:
Optimal Design of Composite Structures. Encyclopedia of Optimization 2009: 2718-2725 - 2008
- [c2]Cherry Wakayama, Wolf Kohn, Zelda B. Zabinsky, Chuanjin Richard Shi:
A quantum-dot light-harvesting architecture using deterministic phase control. ISCAS 2008: 332-335 - 2007
- [j16]Mirjam Dür, Charoenchai Khompatraporn, Zelda B. Zabinsky:
Solving fractional problems with dynamic multistart improving hit-and-run. Ann. Oper. Res. 156(1): 25-44 (2007) - [j15]Yanfang Shen, Seksan Kiatsupaibul, Zelda B. Zabinsky, Robert L. Smith:
An analytically derived cooling schedule for simulated annealing. J. Glob. Optim. 38(3): 333-365 (2007) - 2006
- [j14]Berkin Toktas, Joyce W. Yen, Zelda B. Zabinsky:
Addressing capacity uncertainty in resource-constrained assignment problems. Comput. Oper. Res. 33: 724-745 (2006) - [j13]Wolf Kohn, Zelda B. Zabinsky, Vladimir Brayman:
Optimization of Algorithmic Parameters using a Meta-Control Approach. J. Glob. Optim. 34(2): 293-316 (2006) - 2005
- [j12]Charoenchai Khompatraporn, János D. Pintér, Zelda B. Zabinsky:
Comparative Assessment of Algorithms and Software for Global Optimization. J. Glob. Optim. 31(4): 613-633 (2005) - [j11]M. Montaz Ali
, Charoenchai Khompatraporn, Zelda B. Zabinsky:
A Numerical Evaluation of Several Stochastic Algorithms on Selected Continuous Global Optimization Test Problems. J. Glob. Optim. 31(4): 635-672 (2005) - 2003
- [j10]Zelda B. Zabinsky, Robert L. Smith, Birna P. Kristinsdottir:
Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds. Comput. Oper. Res. 30(10): 1539-1553 (2003) - [j9]Vladimir Brayman, Zelda B. Zabinsky, Wolf Kohn:
Decentralized Dual-Based Algorithm for Computing Optimal Flows in a General Supply Chain. J. Glob. Optim. 26(1): 79-96 (2003) - 2001
- [j8]Graham R. Wood, Zelda B. Zabinsky, Birna P. Kristinsdottir:
Hesitant adaptive search: the distribution of the number of iterations to convergence. Math. Program. 89(3): 479-486 (2001)
1990 – 1999
- 1998
- [j7]Zelda B. Zabinsky:
Stochastic Methods for Practical Global Optimization. J. Glob. Optim. 13(4): 433-444 (1998) - 1995
- [j6]Tibor Csendes, Zelda B. Zabinsky, Birna P. Kristinsdottir:
Constructing large feasible suboptimal intervals for constrained nonlinear optimization. Ann. Oper. Res. 58(4): 279-293 (1995) - [j5]W. P. Baritompa, Baoping Zhang, Regina Hunter Mladineo, Graham R. Wood, Zelda B. Zabinsky:
Towards Pure Adaptive Search - A general framework and a one-dimensional realisation. J. Glob. Optim. 7(1): 93-110 (1995) - [j4]Zelda B. Zabinsky, Graham R. Wood, Mike A. Steel
, William Baritompa:
Pure adaptive search for finite global optimization. Math. Program. 69: 443-448 (1995) - 1993
- [j3]Zelda B. Zabinsky, Robert L. Smith, J. Fred McDonald, H. Edwin Romeijn, David E. Kaufman:
Improving Hit-and-Run for global optimization. J. Glob. Optim. 3(2): 171-192 (1993) - [c1]Richard Lee Storch, Wenwei Song, Zelda B. Zabinsky:
Scheduling a Chemical Processing Tank Line. APMS 1993: 457-468 - 1992
- [j2]Zelda B. Zabinsky, Robert L. Smith:
Pure adaptive search in global optimization. Math. Program. 53: 323-338 (1992)
1980 – 1989
- 1989
- [j1]Nitin R. Patel, Robert L. Smith, Zelda B. Zabinsky:
Pure adaptive search in monte carlo optimization. Math. Program. 43(1-3): 317-328 (1989)
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-02-27 22:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint