Some Computational Procedures for the Best Subset Problem

M. J. Garside

Journal of the Royal Statistical Society Series C, 1971, vol. 20, issue 1, 8-15

Abstract: In an earlier paper, Garside (1965) gave an algorithm for calculating all subsets in multiple‐regression analysis, thereby obtaining the subset of a given size that minimized the minimum residual sum of squares. This paper develops further the facilities in the earlier algorithm and introduces a new algorithm which, although slightly restrictive, is very much faster in execution.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.2307/2346626

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jorssc:v:20:y:1971:i:1:p:8-15

Ordering information: This journal article can be ordered from
http://ordering.onli ... 1111/(ISSN)1467-9876

Access Statistics for this article

Journal of the Royal Statistical Society Series C is currently edited by R. Chandler and P. W. F. Smith

More articles in Journal of the Royal Statistical Society Series C from Royal Statistical Society Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().