Rapid screening algorithms for stochastically constrained problems
From MaRDI portal
Publication:2400026
DOI10.1007/s10479-017-2459-6zbMath1369.90115OpenAlexW2592052084MaRDI QIDQ2400026
Publication date: 25 August 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2459-6
Related Items (2)
Augmented simulation methods for discrete stochastic optimization with recourse ⋮ Efficient optimization algorithms for surgical scheduling under uncertainty
Cites Work
- Simulation and multicriteria optimization modeling approach for regional water restoration management
- A revisit of two-stage selection procedures
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
- Experiments in quadratic 0-1 programming
- Call center staffing with simulation and cutting plane methods
- Controlled multistage selection procedures for comparison with a standard
- A sequential procedure for neighborhood selection-of-the-best in optimization via simulation
- Penalty Function with Memory for Discrete Optimization via Simulation with Stochastic Constraints
- Selecting a Selection Procedure
- Screening and selection procedures with control variates and correlation induction techniques
- Ordinal optimisation and simulation
- Adaptive random search for continuous simulation optimization
- Using Ranking and Selection to “Clean Up” after Simulation Optimization
- On two-stage selection procedures and related probability-inequalities
- A fully sequential procedure for indifference-zone selection in simulation
- Finding feasible systems in the presence of constraints on multiple performance measures
- Approximate Simulation Budget Allocation for Selecting the Best Design in the Presence of Stochastic Constraints
- Simulation optimization: a review of algorithms and applications
This page was built for publication: Rapid screening algorithms for stochastically constrained problems
