Publisher
Springer Nature Singapore
Reference19 articles.
1. Welch, W.J.: Algorithmic complexity: three NP-hard problems in computational statistics. J. Stat. Comput. Simul. 15(1), 17–25 (1982)
2. Fedorov, V.: Theory of optimal experiments. Translated from the Russian and edited by WJ Studden and EM Klimko. Probabil. Math. Stat. 12 (1972)
3. Wynn, H.P.: The sequential generation of D-optimum experimental designs. Ann. Math. Stat. 41(5), 1655–1664 (1970)
4. Silvey, S., Titterington, D., Torsney, B.: An algorithm for optimal designs on a design space. Commun. Statist.-Theory Methods 7(14), 1379–1389 (1978)
5. Yu, Y.: D-optimal designs via a cocktail algorithm. Stat. Comput. 21, 475–481 (2011)