A review of some exchange algorithms for constructing discrete D-optimal designs
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Bergtold, Jason S. & Shanoyan, Aleksan & Fewell, Jason E. & Williams, Jeffery R., 2017. "Annual bioenergy crops for biofuels production: Farmers' contractual preferences for producing sweet sorghum," Energy, Elsevier, vol. 119(C), pages 724-731.
- García-Ródenas, Ricardo & García-García, José Carlos & López-Fidalgo, Jesús & Martín-Baos, José Ángel & Wong, Weng Kee, 2020. "A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs," Computational Statistics & Data Analysis, Elsevier, vol. 144(C).
- Fewell, Jason E. & Bergtold, Jason S. & Williams, Jeffery R., 2016. "Farmers' willingness to contract switchgrass as a cellulosic bioenergy crop in Kansas," Energy Economics, Elsevier, vol. 55(C), pages 292-302.
- Moein Saleh & Ming-Hung Kao & Rong Pan, 2017. "Design D-optimal event-related functional magnetic resonance imaging experiments," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 66(1), pages 73-91, January.
- CUERVO, Daniel Palhazi & GOOS, Peter & SÖRENSEN, Kenneth, 2013. "An iterated local search algorithm for the construction of large scale D-optimal experimental designs," Working Papers 2013006, University of Antwerp, Faculty of Business and Economics.
- Sung Jung, Joo & Jin Yum, Bong, 1996. "Construction of exact D-optimal designs by tabu search," Computational Statistics & Data Analysis, Elsevier, vol. 21(2), pages 181-191, February.
- Nguyen, Nam-Ky & Liu, Min-Qian, 2008. "An algorithmic approach to constructing mixed-level orthogonal and near-orthogonal arrays," Computational Statistics & Data Analysis, Elsevier, vol. 52(12), pages 5269-5276, August.
- Arnouts, Heidi & Goos, Peter, 2010.
"Update formulas for split-plot and block designs,"
Computational Statistics & Data Analysis, Elsevier, vol. 54(12), pages 3381-3391, December.
- ARNOUTS, Heidi & GOOS, Peter, 2008. "Update formulas for split-plot and block designs," Working Papers 2008022, University of Antwerp, Faculty of Business and Economics.
- Szu Hui Ng & Stephen E. Chick, 2004. "Design of follow‐up experiments for improving model discrimination and parameter estimation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(8), pages 1129-1148, December.
- De Zhang & Mingqiang Li & Feng Zhang & Maojun Fan, 2019. "New gradient methods for sensor selection problems," International Journal of Distributed Sensor Networks, , vol. 15(3), pages 15501477198, March.
- Wachowicz, Tomasz & Roszkowska, Ewa, 2022. "Can holistic declaration of preferences improve a negotiation offer scoring system?," European Journal of Operational Research, Elsevier, vol. 299(3), pages 1018-1032.
- Dongying Wang & Sumin Wang, 2023. "Constructing Optimal Designs for Order-of-Addition Experiments Using a Hybrid Algorithm," Mathematics, MDPI, vol. 11(11), pages 1-20, May.
- Godolphin, J.D. & Warren, H.R., 2014. "An efficient procedure for the avoidance of disconnected incomplete block designs," Computational Statistics & Data Analysis, Elsevier, vol. 71(C), pages 1134-1146.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:14:y:1992:i:4:p:489-498. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.