An integer programming algorithm for constructing maximin distance designs from good lattice point sets

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Exploratory designs for computational experiments
Algorithms for generating maximin Latin hypercube and orthogonal designs
Design of computer experiments: space filling and beyond
Optimizing Latin hypercube designs by particle swarm
Finding maximin Latin hypercube designs by iterated local search heuristics
Algorithmic construction of optimal symmetric Latin hypercube designs.
The design and analysis of computer experiments
Computational study of a family of mixed-integer quadratic programming problems
Using integer programming techniques for the solution of an experimental design problem
A brief history of linear and mixed-integer programming computation
Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
An efficient algorithm for constructing optimal design of computer experiments
A study on algorithms for optimization of Latin hypercubes
Bounds for Maximin Latin Hypercube Designs
Maximin Latin Hypercube Designs in Two Dimensions
Space-filling properties of good lattice point sets
Uniform Design: Theory and Application
Construction of Maximin Distance Designs via Level Permutation and Expansion
Constructing nearly orthogonal latin hypercubes for any nonsaturated run-variable combination
Mixed Integer Programming: Analyzing 12 Years of Progress
Construction of maximin distance Latin squares and related Latin hypercube designs
Mixed integer programming formulations for the generalized traveling salesman problem with time windows