Bandits help simulated annealing to complete a maximin Latin hypercube design

DOI10.1007/978-3-319-93031-2_20OpenAlexW2804596260MaRDI QIDQ1626742

Kaourintin Le Guiban, Joanna Tomasik, Christian Hamelain, Arpad Rimmel

Publication date: 21 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-93031-2_20

zbMATH Keywords

appropriate mutation, completion problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: Bandits help simulated annealing to complete a maximin Latin hypercube design