{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T22:46:37Z","timestamp":1781563597817,"version":"3.54.5"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T00:00:00Z","timestamp":1630022400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T00:00:00Z","timestamp":1630022400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s11222-021-10043-5","type":"journal-article","created":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T15:06:56Z","timestamp":1630076816000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A branch-and-bound algorithm for the exact optimal experimental design problem"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1371-315X","authenticated-orcid":false,"given":"Selin Damla","family":"Ahipa\u015fao\u011flu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,8,27]]},"reference":[{"key":"10043_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1080\/10556780701589669","volume":"23","author":"SD Ahipa\u015fao\u011flu","year":"2008","unstructured":"Ahipa\u015fao\u011flu, S.D., Sun, P., Todd, M.J.: Linear convergence of a Modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoids. Optim. Methods Softw. 23, 5\u201319 (2008)","journal-title":"Optim. Methods Softw."},{"key":"10043_CR2","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1007\/s11222-014-9476-y","volume":"25","author":"SD Ahipa\u015fao\u011flu","year":"2015","unstructured":"Ahipa\u015fao\u011flu, S.D.: A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach. Stat. Comput. 25, 1113\u20131127 (2015)","journal-title":"Stat. Comput."},{"key":"10043_CR3","unstructured":"Allen-Zhu, Z., Li, Y., Singh, A., Wang, Y.: Near-optimal design of experiments via regret minimization. In: Proceedings of Machine Learning Research 126\u2013135,(2017)"},{"key":"10043_CR4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522546.001.0001","volume-title":"Optimum Experimental Designs, with SAS","author":"AC Atkinson","year":"1992","unstructured":"Atkinson, A.C., Donev, A.N., Tobias, R.D.: Optimum Experimental Designs, with SAS. Oxford University Press, Oxford (1992)"},{"issue":"2","key":"10043_CR5","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1214\/aos\/1176342371","volume":"1","author":"CL Atwood","year":"1973","unstructured":"Atwood, C.L.: Sequences converging to D-optimal designs of experiments. Ann. Stat. 1(2), 342\u2013352 (1973)","journal-title":"Ann. Stat."},{"issue":"4","key":"10043_CR6","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1137\/120867287","volume":"34","author":"H Avron","year":"2013","unstructured":"Avron, H., Boutsidis, C.: Faster subset selection for matrices and applications. SIAM J. Matrix Anal. Appl. 34(4), 1464\u20131499 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"10043_CR7","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01894766","volume":"33","author":"D B\u00f6hning","year":"1986","unstructured":"B\u00f6hning, D.: A vertex-exchange-method in D-optimal design theory. Metrika 33(1), 337\u2013347 (1986)","journal-title":"Metrika"},{"key":"10043_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.endm.2010.05.086","volume":"36","author":"M Bouhtou","year":"2010","unstructured":"Bouhtou, M., Gaubert, S., Sagnol, G.: Submodularity and randomized rounding techniques for optimal experimental design. Electron. Notes Discrete Math. 36, 67\u2013686 (2010)","journal-title":"Electron. Notes Discrete Math."},{"issue":"370","key":"10043_CR9","first-page":"366","volume":"75","author":"RD Cook","year":"1980","unstructured":"Cook, R.D., Thibodeau, L.A.: Marginally restricted D-optimal designs. J. Am. Stat. Assoc. 75(370), 366\u2013371 (1980)","journal-title":"J. Am. Stat. Assoc."},{"key":"10043_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/02331889508802474","volume":"26","author":"RD Cook","year":"1995","unstructured":"Cook, R.D., Fedorov, V.V.: Constrained optimization of experimental design. Statistics 26, 129\u2013178 (1995)","journal-title":"Statistics"},{"key":"10043_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1080\/00401706.1980.10486162","volume":"22","author":"RD Cook","year":"1995","unstructured":"Cook, R.D., Nachtsheim, C.J.: A comparison of algorithms for constructing exact D-optimal designs. Technometrics 22, 315\u2013324 (1995)","journal-title":"Technometrics"},{"key":"10043_CR12","volume-title":"Theory of Optimal Experiments","author":"VV Fedorov","year":"1972","unstructured":"Fedorov, V.V.: Theory of Optimal Experiments. Academic Press, New York (1972)"},{"key":"10043_CR13","doi-asserted-by":"publisher","DOI":"10.1201\/b15054","volume-title":"Optimal Design for Nonlinear Response Models","author":"VV Fedorov","year":"2013","unstructured":"Fedorov, V.V., Leonov, S.L.: Optimal Design for Nonlinear Response Models. CRC Press, Boca Raton (2013)"},{"key":"10043_CR14","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s00180-020-00961-9","volume":"35","author":"L Filova","year":"2020","unstructured":"Filova, L., Harman, R.: Ascent with quadratic assistance for the construction of exact experimental designs. Comput. Stat. 35, 775\u2013801 (2020)","journal-title":"Comput. Stat."},{"key":"10043_CR15","doi-asserted-by":"publisher","first-page":"106844","DOI":"10.1016\/j.csda.2019.106844","volume":"144","author":"R Garc\u00eda-Rdenas","year":"2020","unstructured":"Garc\u00eda-Rdenas, R., Garc\u00eda-Garc\u00eda, J.C., L\u00f3pez-Fidalgo, J., Mart\u00edn-Baos, J.A., Wong, W.K.: A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs. Comput. Stat. Data Anal. 144, 106844 (2020)","journal-title":"Comput. Stat. Data Anal."},{"key":"10043_CR16","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/j.csda.2013.02.021","volume":"71","author":"R Harman","year":"2014","unstructured":"Harman, R., Filova, L.: Computing efficient exact designs of experiments using integer quadratic programming. Comput. Stat. Data Anal. 71, 1159\u20131167 (2014)","journal-title":"Comput. Stat. Data Anal."},{"issue":"529","key":"10043_CR17","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1080\/01621459.2018.1546588","volume":"115","author":"R Harman","year":"2020","unstructured":"Harman, R., Filova, L., Richtarik, P.: A randomized exchange algorithm for computing optimal approximate designs of experiments. J. Am. Stat. Assoc. 115(529), 348\u2013361 (2020)","journal-title":"J. Am. Stat. Assoc."},{"key":"10043_CR18","doi-asserted-by":"crossref","unstructured":"Harman, R., Sagnol, G .: Computing D-optimal experimental designs for estimating treatment contrasts under the presence of a nuisance time trend. In: Steland A., Rafajlowicz E., Szajowski K. (eds.) Stochastic Models, Statistics and Their Applications, Springer Proceedings in Mathematics & Statistics, vol. 122, pp. 83\u201391 (2015)","DOI":"10.1007\/978-3-319-13881-7_10"},{"issue":"5","key":"10043_CR19","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1214\/aos\/1176342810","volume":"2","author":"J Kiefer","year":"1974","unstructured":"Kiefer, J.: General equivalence theory for optimum designs (approximate theory). Ann. Stat. 2(5), 849\u2013879 (1974)","journal-title":"Ann. Stat."},{"issue":"1","key":"10043_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-005-2653-6","volume":"126","author":"P Kumar","year":"2005","unstructured":"Kumar, P., Y\u0131ld\u0131r\u0131m, E.A.: Minimum volume enclosing ellipsoids and core sets. J. Optim. Theory Appl. 126(1), 1\u201321 (2005)","journal-title":"J. Optim. Theory Appl."},{"key":"10043_CR21","first-page":"2210","volume":"99","author":"V Madan","year":"2019","unstructured":"Madan, V., Singh, M., Tantipongpipat, U., Xie, W.: Combinatorial algorithms for optimal design. Proc. Mach. Learn. Res. 99, 2210\u20132258 (2019)","journal-title":"Proc. Mach. Learn. Res."},{"key":"10043_CR22","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1080\/00401706.1995.10485889","volume":"37","author":"RK Meyer","year":"1995","unstructured":"Meyer, R.K., Nachtsheim, C.J.: The coordinate-exchange algorithm for constructing exact optimal experimental designs. Technometrics 37, 60\u201369 (1995)","journal-title":"Technometrics"},{"key":"10043_CR23","first-page":"203","volume":"20","author":"TJ Mitchell","year":"1974","unstructured":"Mitchell, T.J.: An algorithm for the construction of D-optimal designs. Technometrics 20, 203\u2013210 (1974)","journal-title":"Technometrics"},{"key":"10043_CR24","doi-asserted-by":"crossref","unstructured":"Nikolov, A., Singh, M., and Tantipongpipat, U.: Proportional volume sampling and approximation algorithms for A-optimal design. In: SODA\u201919: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1369\u20131386. SIAM, (2019)","DOI":"10.1137\/1.9781611975482.84"},{"key":"10043_CR25","volume-title":"Optimal Design of Experiments","author":"F Pukelsheim","year":"1993","unstructured":"Pukelsheim, F.: Optimal Design of Experiments. John Wiley and Sons, New York (1993)"},{"key":"10043_CR26","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1093\/biomet\/79.4.763","volume":"79","author":"F Pukelsheim","year":"1992","unstructured":"Pukelsheim, F., Rieder, S.: Efficient rounding of approximate designs. Biometrika 79, 763\u2013770 (1992)","journal-title":"Biometrika"},{"key":"10043_CR27","doi-asserted-by":"publisher","first-page":"2198","DOI":"10.1214\/15-AOS1339","volume":"43","author":"G Sagnol","year":"2015","unstructured":"Sagnol, G., Harman, R.: Computing exact D-optimal designs by mixed integer second-order cone programming. Ann. Stat. 43, 2198\u20132224 (2015)","journal-title":"Ann. Stat."},{"key":"10043_CR28","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1093\/biomet\/60.1.21","volume":"60","author":"SD Silvey","year":"1973","unstructured":"Silvey, S.D., Titterington, D.M.: A geometric approach to optimum design theory. Biometrika 60, 21\u201332 (1973)","journal-title":"Biometrika"},{"key":"10043_CR29","doi-asserted-by":"crossref","unstructured":"Singh, M., Xie, W.: Approximate positive correlated distributions and approximation algorithms for D-optimal design. In: SODA\u201918: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2240\u20132255. SIAM, (2018)","DOI":"10.1137\/1.9781611975031.145"},{"key":"10043_CR30","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1287\/opre.1040.0115","volume":"52","author":"P Sun","year":"2004","unstructured":"Sun, P., Freund, R.M.: Computation of minimum volume covering ellipsoids. Operations Res. 52, 690\u2013706 (2004)","journal-title":"Operations Res."},{"key":"10043_CR31","doi-asserted-by":"publisher","first-page":"1731","DOI":"10.1016\/j.dam.2007.02.013","volume":"155","author":"MJ Todd","year":"2007","unstructured":"Todd, M.J., Y\u0131ld\u0131r\u0131m, E.A.: On Khachiyans algorithm for the computation of minimum volume enclosing ellipsoids. Discrete Appl. Math. 155, 1731\u20131744 (2007)","journal-title":"Discrete Appl. Math."},{"key":"10043_CR32","doi-asserted-by":"publisher","first-page":"3947","DOI":"10.1016\/j.jspi.2009.05.007","volume":"139","author":"B Torsney","year":"2009","unstructured":"Torsney, B., Martin-Martin, R.R.: Multiplicative algorithms for computing optimum designs. J. Stat. Plan. Inference 139, 3947\u20133961 (2009)","journal-title":"J. Stat. Plan. Inference"},{"key":"10043_CR33","doi-asserted-by":"crossref","unstructured":"Ucinski, D.: Sensor network scheduling for identification of spatially distributed processes. Int. J. Appl. Math. Comput. Sci. 22(1), 25\u201340 (2012)","DOI":"10.2478\/v10006-012-0002-0"},{"key":"10043_CR34","first-page":"461","volume-title":"Statistics and Their Applications","author":"D Ucinski","year":"2015","unstructured":"Ucinski, D.: An algorithm for construction of constrained D-optimum designs. In: Models, Stochastic (ed.) Statistics and Their Applications, pp. 461\u2013468. Cham, Springer (2015)"},{"key":"10043_CR35","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10898-007-9139-z","volume":"39","author":"D Ucinski","year":"2007","unstructured":"Ucinski, D., Patan, M.: D-optimal design of a monitoring network for parameter estimation of distributed systems. J. Glob. Optim. 39, 291\u2013322 (2007)","journal-title":"J. Glob. Optim."},{"issue":"143","key":"10043_CR36","first-page":"1","volume":"18","author":"Y Wang","year":"2017","unstructured":"Wang, Y., Yu, A.W., Singh, A.: On computationally tractable selection of experiments in regression models. J. Mach. Learn. Res. 18(143), 1\u201341 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"10043_CR37","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1080\/00949658208810560","volume":"15","author":"WJ Welch","year":"1982","unstructured":"Welch, W.J.: Algorithmic complexity: three NP-hard problems in computational statistics. J. Stat. Comput. Simul. 15, 17\u201325 (1982)","journal-title":"J. Stat. Comput. Simul."},{"key":"10043_CR38","first-page":"41","volume":"24","author":"WJ Welch","year":"1982","unstructured":"Welch, W.J.: Branch-and-Bound search for experimental designs based on $$D$$ optimality and other criteria. Technometrics 24, 41\u201348 (1982)","journal-title":"Technometrics"},{"key":"10043_CR39","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1111\/j.2517-6161.1972.tb00896.x","volume":"34","author":"HP Wynn","year":"1972","unstructured":"Wynn, H.P.: Results in the theory and construction of D-optimum experimental designs. J. Royal Stat. Soc. Series B (Methodol.) 34, 133\u2013147 (1972)","journal-title":"J. Royal Stat. Soc. Series B (Methodol.)"},{"key":"10043_CR40","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s11222-010-9183-2","volume":"21","author":"Y Yu","year":"2011","unstructured":"Yu, Y.: D-optimal designs via a cocktail algorithm. Stat. Comput. 21, 475\u2013481 (2011)","journal-title":"Stat. Comput."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-021-10043-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-021-10043-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-021-10043-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:39:09Z","timestamp":1725701949000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-021-10043-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,27]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["10043"],"URL":"https:\/\/doi.org\/10.1007\/s11222-021-10043-5","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,27]]},"assertion":[{"value":"9 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"65"}}