On greedy heuristics for computing D-efficient saturated subsets
Year of publication: |
2020
|
---|---|
Authors: | Harman, Radoslav ; Rosa, Samuel |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 2, p. 122-129
|
Subject: | D-optimality | Greedy heuristic | Minimum-volume enclosing ellipsoid | Optimal experimental design | Subsampling | Heuristik | Heuristics | Theorie | Theory | Experiment |
-
Brandt, Felix, (2013)
-
Scheduling evacuation operations
Deghdak, Kaouthar, (2016)
-
A greedy heuristic for shift minimization personnel task scheduling problem
Hojati, Mehran, (2018)
- More ...
-
Minimal efficiency of designs under the class of orthogonally invariant information criteria
Harman, Radoslav, (2004)
-
Computing efficient exact designs of experiments using integer quadratic programming
Harman, Radoslav, (2014)
-
Lacko, VladimĂr, (2012)
- More ...