default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoung H. Chun
Person information
- affiliation: Louisiana State University, Baton Rouge, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Young H. Chun
, Edward F. Watson:
Markov chain Monte Carlo approach to the analysis of response patterns in data collection process. INFOR Inf. Syst. Oper. Res. 61(4): 509-529 (2023)- [j17]Young H. Chun:
Economic design of multiple inspection plans via the expectation-maximization algorithm. J. Oper. Res. Soc. 74(3): 762-776 (2023) - 2020
- [j16]Young H. Chun:
Information economics approach to the performance evaluation of error-prone internal auditors. J. Oper. Res. Soc. 71(2): 264-279 (2020)
2010 – 2019
- 2016
- [j15]Young H. Chun:
Designing repetitive screening procedures with imperfect inspections: An empirical Bayes approach. Eur. J. Oper. Res. 253(3): 639-647 (2016) - 2015
- [j14]Young H. Chun:
Multi-attribute sequential decision problem with optimizing and satisficing attributes. Eur. J. Oper. Res. 243(1): 224-232 (2015) - 2012
- [j13]Young H. Chun:
Monte Carlo analysis of estimation methods for the prediction of customer response patterns in direct marketing. Eur. J. Oper. Res. 217(3): 673-678 (2012)
2000 – 2009
- 2008
- [j12]Young H. Chun:
Bayesian Analysis of the Sequential Inspection Plan via the Gibbs Sampler. Oper. Res. 56(1): 235-246 (2008) - [j11]Young H. Chun:
Economic optimization of off-line inspection procedures with inspection errors. J. Oper. Res. Soc. 59(6): 863-865 (2008) - 2007
- [j10]Young H. Chun, Robert T. Sumichrast:
Bayesian inspection model with the negative binomial prior in the presence of inspection errors. Eur. J. Oper. Res. 182(3): 1188-1202 (2007) - 2006
- [j9]Young H. Chun, Robert T. Sumichrast:
A rank-based approach to the sequential selection and assignment problem. Eur. J. Oper. Res. 174(2): 1338-1344 (2006) - [j8]Young H. Chun:
Estimating the number of undetected software errors via the correlated capture-recapture model. Eur. J. Oper. Res. 175(2): 1180-1192 (2006) - 2005
- [j7]Young H. Chun, Robert T. Sumichrast:
Estimating the market shares of stores based on the shopper's search and purchase behavior. Eur. J. Oper. Res. 166(2): 576-592 (2005) - 2004
- [j6]Young H. Chun:
Generalized best choice problem based on the information economics approach. J. Oper. Res. Soc. 55(9): 988-999 (2004) - 2003
- [j5]Young H. Chun:
Optimal pricing and ordering policies for perishable commodities. Eur. J. Oper. Res. 144(1): 68-82 (2003) - 2002
- [j4]Young H. Chun, Robert D. Plante, Helmut Schneider:
Buying and selling an asset over the finite time horizon: A non-parametric approach. Eur. J. Oper. Res. 136(1): 106-120 (2002) - 2001
- [j3]Young H. Chun:
Optimal partitioning of groups in selecting the best choice. Comput. Oper. Res. 28(14): 1367-1386 (2001) - 2000
- [j2]Young H. Chun:
Sequential Search and Selection Problem Under Uncertainty. Decis. Sci. 31(3): 627-648 (2000)
1990 – 1999
- 1999
- [j1]Young H. Chun:
Selecting the best choice in the full information group interview problem. Eur. J. Oper. Res. 119(3): 635-651 (1999)
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-25 05:58 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:
