Constructing uniform designs: A heuristic integer programming method
From MaRDI portal
Publication:413474
DOI10.1016/J.JCO.2011.10.005zbMATH Open1242.90114OpenAlexW1970045329MaRDI QIDQ413474FDOQ413474
Kai-Tai Fang, Jian-Hui Ning, Yong-Dao Zhou
Publication date: 7 May 2012
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2011.10.005
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
- Construction of polygonal designs using linear integer programming
- Theory and application of uniform designs
- Construction of uniform designs without replications
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalized discrepancy and quadrature error bound
- Introduction to global optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
- Lower bounds of the wrap-around \(L_2\)-discrepancy and relationships between MLHD and uniform design with a large size
- Lower bounds for wrap-around \(L_2\)-discrepancy and constructions of symmetrical uniform designs
Cited In (10)
- Construction of uniform designs without replications
- Uniformity criterion for designs with both qualitative and quantitative factors
- Deterministic construction methods for uniform designs
- Nearly uniform design construction on flexible region
- Optimal foldover plans of asymmetric factorials with minimum wrap-around \(L_2\)-discrepancy
- Construction of main effects plans orthogonal through the block factor based on level permutation
- Constructing uniform designs under mixture discrepancy
- Construction of uniform designs via an adjusted threshold accepting algorithm
- Level permutation method for constructing uniform designs under the wrap-around \(L_2\)-discrepancy
- Measures of uniformity in experimental designs: A selective overview
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)
