See Welch, W.J. (1982). Branch-and-bound search
for experimental designs based on D optimality and
other criteria. Technometrics. 24. 41-48.
Salem S Reyen wrote:
>
> Hi,
>
> Is d-optimal experiment designs a NP-complete problem?
> Does anyone know where I can acess the paper that shows
Hi,
Is d-optimal experiment designs a NP-complete problem?
Does anyone know where I can acess the paper that shows that?
Thanks.
Regards,
--
Salem
=
Instructions for joining and leaving this list and remarks about
the pr
