A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty
From MaRDI portal
Publication:1634054
DOI10.1016/j.cor.2018.10.013zbMath1458.90524arXiv1809.02437OpenAlexW2892114746WikidataQ129085411 ScholiaQ129085411MaRDI QIDQ1634054
Publication date: 17 December 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.02437
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Particle swarm metaheuristics for robust optimisation with implementation uncertainty ⋮ Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A new expected-improvement algorithm for continuous minimax optimization
- A bicriteria approach to robust optimization
- A literature survey of benchmark functions for global optimisation problems
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robust optimization - a comprehensive survey
- Locational optimization problems solved through Voronoi diagrams
- Efficient global optimization of expensive black-box functions
- An optimal convex hull algorithm in any fixed dimension
- Robust discrete optimization and its applications
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- Expected improvement based infill sampling for global robust optimization of constrained problems
- Evolutionary robust optimization in production planning -- interactions between number of objectives, sample size and choice of robustness measure
- Decision uncertainty in multiobjective optimization
- Worst-case global optimization of black-box functions through Kriging and relaxation
- Robust Convex Optimization
- Nonconvex Robust Optimization for Problems with Constraints
- Computing largest empty circles with location constraints
- Distributionally Robust Optimization and Its Tractable Approximations
- A Soft Robust Model for Optimization Under Ambiguity
- Robust Optimization for Unconstrained Simulation-Based Problems
- The Price of Robustness
- Surrogate‐based methods for black‐box optimization
This page was built for publication: A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty
