New bounds for subset selection from conic relaxations
Year of publication: |
2022
|
---|---|
Authors: | Ben-Ameur, Walid ; Neto, José |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 298.2022, 2 (1.4.), p. 425-438
|
Subject: | Combinatorial optimization | Convex relaxation | Subset selection | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Picking winners : diversification through portfolio optimization
Liu, Ju, (2023)
-
A note on appointment scheduling with piecewise linear cost functions
Ge, Dongdong, (2014)
-
A second-order cone model of transmission planning with alternating and direct current lines
Lesage-Landry, Antoine, (2020)
- More ...
-
Spectral bounds for unconstrained (-1,1)-quadratic optimization problems
Ben-Ameur, Walid, (2010)
-
Spectral bounds for unconstrained (−1,1)-quadratic optimization problems
Ben-Ameur, Walid, (2010)
-
Spectral bounds for unconstrained (−1,1)-quadratic optimization problems
Ben-Ameur, Walid, (2010)
- More ...