Bounds for Maximin Latin Hypercube Designs
From MaRDI portal
Publication:3100370
DOI10.1287/opre.1080.0604zbMath1229.90174OpenAlexW2098107291MaRDI QIDQ3100370
van Dam, Edwin R., Bart Husslage, Gijs Rennen
Publication date: 24 November 2011
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/f556d9e2-e3b9-42db-96ee-94d31c3ba7d6
maximintraveling salesman problemgraph coveringmixed-integer programmingLatin hypercube designspace-fillingsimulation: design of experiments
Mixed integer programming (90C11) Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)
Related Items (12)
Asymptotically optimal maximin distance Latin hypercube designs ⋮ Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints ⋮ Nested maximin Latin hypercube designs ⋮ Generating and improving orthogonal designs by using mixed integer programming ⋮ Space-filling Latin hypercube designs for computer experiments ⋮ A standardized distance-based index to assess the quality of space-filling designs ⋮ Orthogonal-column Latin hypercube designs with small samples ⋮ Design of computer experiments: space filling and beyond ⋮ One-dimensional nested maximin designs ⋮ Two-dimensional minimax Latin hypercube designs ⋮ Optimizing Latin hypercube designs by particle swarm ⋮ The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem
Uses Software
This page was built for publication: Bounds for Maximin Latin Hypercube Designs
