Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing

DOI10.1287/IJOC.2020.1054MaRDI QIDQ5084671zbMATH OpenOpenAlexFDO

Authors Ying Zhong, Shaoxuan Liu, Jun Luo, L. Jeff Hong

Publication date 28 June 2022

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2020.1054

zbMATH Keywords

computational complexityfully sequential proceduresparallel computingranking and selection

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
• Efficient ranking and selection in parallel computing environments
• Knockout-tournament procedures for large-scale ranking and selection in parallel computing environments
• Parallel Adaptive Survivor Selection
• Solving Large-Scale Fixed-Budget Ranking and Selection Problems

Cites work

• A Comparison of the Asymptotic Expected Sample Sizes of Two Sequential Procedures for Ranking Problem
• A fully sequential procedure for indifference-zone selection in simulation
• A Sequential Procedure for Selecting the Population with the Largest Mean from k Normal Populations
• A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances
• Efficient ranking and selection in parallel computing environments
• Fully sequential indifference‐zone selection procedures with variance‐dependent sampling
• Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
• On two-stage selection procedures and related probability-inequalities
• Sequential selectiok procedures based on confidence sequences for normal populations
• Stochastic models of manufacturing systems.

Cited in

(10)

• Efficient estimation of a risk measure requiring two-stage simulation optimization
• Asymptotic efficiency analysis on the modified Paulson's procedure with a PAC guarantee
• Case study on the superlinear speedup of a parallel numerical model
• Solving Large-Scale Fixed-Budget Ranking and Selection Problems
• Parallel Adaptive Survivor Selection
• Efficient simulation budget allocation for contextual ranking and selection with quadratic models
• Knowledge gradient procedure to select the best system under pairwise comparisons
• Simulation budget allocation for improving scheduling and routing of automated guided vehicles in warehouse management
• Blackbox simulation optimization
• Review of large-scale simulation optimization

Describes a project that uses

Uses Software

• SimOpt

This page was built for publication: Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084671)