Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
Year of publication: |
2012
|
---|---|
Authors: | Carbonneau, Réal A. ; Caporossi, Gilles ; Hansen, Pierre |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 39.2012, 11, p. 2748-2762
|
Subject: | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Branch-and-Bound | Branch and Bound | Regressionsanalyse | Regression analysis |
-
SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression
Flores, Salvador, (2015)
-
A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
Sass, Susanne, (2024)
-
Ozturk, Onur, (2017)
- More ...
-
Globally optimal clusterwise regression by mixed logical-quadratic programming
Carbonneau, Réal A., (2011)
-
Globally optimal clusterwise regression by mixed logical-quadratic programming
Carbonneau, Réal A., (2011)
-
Globally optimal clusterwise regression by mixed logical-quadratic programming
Carbonneau, Réal A., (2011)
- More ...