The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem

DOI10.1287/opre.2017.1665zbMath1456.62167OpenAlexW2767211014MaRDI QIDQ4969322

Kaourintin Le Guiban, Arpad Rimmel, Marc-Antoine Weisser, Joanna Tomasik

Publication date: 5 October 2020

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2017.1665

zbMATH Keywords

approximation algorithmexperimental designLatin hypercube designspace-filling designmaximin design

Mathematics Subject Classification ID

Statistical block designs (62K10) Response surface designs (62K20)

Related Items

10 Kriging: methods and applications, Screening: from tornado diagrams to effective dimensions

Uses Software

• EGO

Cites Work

• Exploratory designs for computational experiments
• Kriging metamodeling in simulation: a review
• Finding maximin Latin hypercube designs by iterated local search heuristics
• Efficient global optimization of expensive black-box functions
• Design and analysis of computer experiments. With comments and a rejoinder by the authors
• An efficient algorithm for constructing optimal design of computer experiments
• A study on algorithms for optimization of Latin hypercubes
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Bounds for Maximin Latin Hypercube Designs
• Maximin Latin Hypercube Designs in Two Dimensions