2019
DOI: 10.1016/j.jspi.2018.03.007
|View full text |Cite
|
Sign up to set email alerts
|

A new efficient MEP.1 series for 2f factorial experiments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…Afterwards, several researchers have considered the construction of search designs; all were reviewed in Ghosh, Shirakura, and Srivastava (2007). Later on, there have been some other studies dealing with such a problem and the search designs; for example, Barati and Talebi (2019a, 2019b) constructed families of search designs for 2 f factorial experiments. Most of these research is logically focused on construction of search designs for 2 f factorial experiments; however, there are some exceptions, including Chatterjee and Mukerjee (1986, 1993) and Chatterjee (1989, 1991), who obtained search designs for 3 m factorial experiments.…”
Section: Introductionmentioning
confidence: 99%
“…Afterwards, several researchers have considered the construction of search designs; all were reviewed in Ghosh, Shirakura, and Srivastava (2007). Later on, there have been some other studies dealing with such a problem and the search designs; for example, Barati and Talebi (2019a, 2019b) constructed families of search designs for 2 f factorial experiments. Most of these research is logically focused on construction of search designs for 2 f factorial experiments; however, there are some exceptions, including Chatterjee and Mukerjee (1986, 1993) and Chatterjee (1989, 1991), who obtained search designs for 3 m factorial experiments.…”
Section: Introductionmentioning
confidence: 99%