SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression
Year of publication: |
2015
|
---|---|
Authors: | Flores, Salvador |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 246.2015, 1 (1.10.), p. 44-50
|
Subject: | Global optimization | Integer programming | High breakdown point regression | Branch and bound | Relaxation-linearization techniques | Mathematische Optimierung | Mathematical programming | Schätztheorie | Estimation theory | Regressionsanalyse | Regression analysis | Ganzzahlige Optimierung | Robustes Verfahren | Robust statistics | Branch-and-Bound | Branch and Bound |
-
A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
Sass, Susanne, (2024)
-
Buchheim, Christoph, (2015)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
- More ...
-
On the efficient computation of robust regression estimators
Flores, Salvador, (2010)
- More ...