Marianna De Santis
Orcid: 0000-0002-1189-5917Affiliations:
- Sapienza University of Rome, Italy
- Technical University of Dortmund, Germany (former)
According to our database1,
Marianna De Santis
authored at least 28 papers
between 2011 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
J. Glob. Optim., January, 2024
2023
Relax and penalize: a new bilevel approach to mixed-binary hyperparameter optimization.
CoRR, 2023
2022
On the exactness of the <i>ε</i>-constraint method for biobjective nonlinear integer programming.
Oper. Res. Lett., 2022
Minimization over the ℓ <sub>1</sub>-ball using an active-set non-monotone projected gradient.
Comput. Optim. Appl., 2022
2021
Comput. Oper. Res., 2021
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective.
4OR, 2021
4OR, 2021
Design of a wearable device for physiological parameter monitoring in a COVID setting.
Proceedings of the 43rd Annual International Conference of the IEEE Engineering in Medicine & Biology Society, 2021
2020
SIAM J. Optim., 2020
Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming.
Eur. J. Oper. Res., 2020
An active-set algorithmic framework for non-convex optimization problems over the simplex.
Comput. Optim. Appl., 2020
2019
An active set algorithm for robust combinatorial optimization based on separation oracles.
Math. Program. Comput., 2019
2018
Oper. Res. Lett., 2018
J. Glob. Optim., 2018
2017
J. Optim. Theory Appl., 2017
2016
A Fast Active Set Block Coordinate Descent Algorithm for ℓ<sub>1</sub>-Regularized Least Squares.
SIAM J. Optim., 2016
A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming.
SIAM J. Optim., 2016
Electron. Notes Discret. Math., 2016
2015
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations.
Oper. Res. Lett., 2015
2014
Discret. Appl. Math., 2014
Combining optimization and machine learning techniques for genome-wide prediction of human cell cycle-regulated genes.
Bioinform., 2014
2013
A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach.
SIAM J. Optim., 2013
An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations.
SIAM J. Optim., 2013
2012
J. Optim. Theory Appl., 2012
An active set feasible method for large-scale minimization problems with bound constraints.
Comput. Optim. Appl., 2012
2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011