2011
DOI: 10.1111/j.1751-5823.2011.00143.x
|View full text |Cite
|
Sign up to set email alerts
|

Rejoinder

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…In order to search through the model space, we thus employ a modification of the leaps package in R [23], which uses an efficient version of the branch-and-bound algorithm first described in [12]. The algorithm can offer vast performance improvements, by eliminating large sections of the search space.…”
Section: A Model Selectionmentioning
confidence: 99%
“…In order to search through the model space, we thus employ a modification of the leaps package in R [23], which uses an efficient version of the branch-and-bound algorithm first described in [12]. The algorithm can offer vast performance improvements, by eliminating large sections of the search space.…”
Section: A Model Selectionmentioning
confidence: 99%