Constructing uniform designs: A heuristic integer programming method
From MaRDI portal
Publication:413474
Recommendations
- Deterministic construction methods for uniform designs
- An efficient method for constructing uniform designs with large size
- Construction of uniform \(U\)-designs
- Construction of cyclic designs using integer programming
- Construction of uniform designs via an adjusted threshold accepting algorithm
- scientific article; zbMATH DE number 4018158
- Construction of polygonal designs using linear integer programming
- Theory and application of uniform designs
- Construction of uniform designs without replications
Cites work
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 1246220 (Why is no real title available?)
- scientific article; zbMATH DE number 735224 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2231192 (Why is no real title available?)
- A generalized discrepancy and quadrature error bound
- Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Introduction to global optimization
- Lower bounds for wrap-around \(L_2\)-discrepancy and constructions of symmetrical uniform designs
- Lower bounds of the wrap-around \(L_2\)-discrepancy and relationships between MLHD and uniform design with a large size
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
Cited in
(10)- Uniformity criterion for designs with both qualitative and quantitative factors
- Construction of uniform designs without replications
- Measures of uniformity in experimental designs: a selective overview
- Construction of main effects plans orthogonal through the block factor based on level permutation
- Construction of uniform designs via an adjusted threshold accepting algorithm
- Nearly uniform design construction on flexible region
- Constructing uniform designs under mixture discrepancy
- Optimal foldover plans of asymmetric factorials with minimum wrap-around \(L_2\)-discrepancy
- Level permutation method for constructing uniform designs under the wrap-around \(L_2\)-discrepancy
- Deterministic construction methods for uniform designs
This page was built for publication: Constructing uniform designs: A heuristic integer programming method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413474)
