default search action
Marianna De Santis
Person information
- affiliation: Sapienza University of Rome, Italy
- affiliation (former): Technical University of Dortmund, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]Enrico Bettiol, Christoph Buchheim, Marianna De Santis
, Francesco Rinaldi:
An oracle-based framework for robust combinatorial optimization. J. Glob. Optim. 88(1): 27-51 (2024) - [j25]Andrea Cristofari, Marianna De Santis, Stefano Lucidi:
On Necessary Optimality Conditions for Sets of Points in Multiobjective Optimization. J. Optim. Theory Appl. 203(1): 126-145 (2024) - 2023
- [i2]Marianna De Santis, Jordan Frécon, Francesco Rinaldi, Saverio Salzo, Martin Schmidt:
Relax and penalize: a new bilevel approach to mixed-binary hyperparameter optimization. CoRR abs/2308.10711 (2023) - 2022
- [j24]Andrea Cristofari, Marianna De Santis
Minimization over the ℓ 1-ball using an active-set non-monotone projected gradient. Comput. Optim. Appl. 83(2): 693-721 (2022) - [j23]Marianna De Santis, Sven de Vries, Martin Schmidt, Lukas Winkel:
A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems. INFORMS J. Comput. 34(6): 3117-3133 (2022) - [j22]Marianna De Santis, Gabriele Eichfelder, Daniele Patria:
On the exactness of the ε-constraint method for biobjective nonlinear integer programming. Oper. Res. Lett. 50(3): 356-361 (2022) - 2021
- [j21]Martina Cerulli
Improving ADMMs for solving doubly nonnegative programs through dual factorization. 4OR 19(3): 415-448 (2021) - [j20]Michele Conforti, Marianna De Santis
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective. 4OR 19(4): 531-548 (2021) - [j19]Marianna De Santis, Gabriele Eichfelder:
A decision space algorithm for multiobjective convex quadratic integer optimization. Comput. Oper. Res. 134: 105396 (2021) - [c3]Marianna De Santis, E. Barcali, Y. Bardacci, L. Rasero, Stefano Bambi
Design of a wearable device for physiological parameter monitoring in a COVID setting. EMBC 2021: 7352-7355 - 2020
- [j18]Andrea Cristofari
An active-set algorithmic framework for non-convex optimization problems over the simplex. Comput. Optim. Appl. 77(1): 57-89 (2020) - [j17]Marianna De Santis
Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming. Eur. J. Oper. Res. 283(1): 57-69 (2020) - [j16]Marianna De Santis, Gabriele Eichfelder
Solving Multiobjective Mixed Integer Convex Optimization Problems. SIAM J. Optim. 30(4): 3122-3145 (2020)
2010 – 2019
- 2019
- [j15]Christoph Buchheim, Marianna De Santis
An active set algorithm for robust combinatorial optimization based on separation oracles. Math. Program. Comput. 11(4): 755-789 (2019) - 2018
- [j14]Christoph Buchheim, Marianna De Santis
A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization. J. Glob. Optim. 70(3): 625-644 (2018) - [j13]Marianna De Santis
Using a factored dual in augmented Lagrangian methods for semidefinite programming. Oper. Res. Lett. 46(5): 523-528 (2018) - 2017
- [j12]Andrea Cristofari
A Two-Stage Active-Set Algorithm for Bound-Constrained Optimization. J. Optim. Theory Appl. 172(2): 369-401 (2017) - 2016
- [j11]Marianna De Santis
Dual approaches for a specific class of integer nonlinear programming problems. Electron. Notes Discret. Math. 55: 73-76 (2016) - [j10]Marianna De Santis
A nonmonotone GRASP. Math. Program. Comput. 8(3): 271-309 (2016) - [j9]Marianna De Santis
A Fast Active Set Block Coordinate Descent Algorithm for ℓ1-Regularized Least Squares. SIAM J. Optim. 26(1): 781-809 (2016) - [j8]Christoph Buchheim
A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming. SIAM J. Optim. 26(3): 1695-1714 (2016) - 2015
- [j7]Christoph Buchheim
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations. Oper. Res. Lett. 43(4): 384-388 (2015) - 2014
- [j6]Marianna De Santis
Combining optimization and machine learning techniques for genome-wide prediction of human cell cycle-regulated genes. Bioinform. 30(2): 228-233 (2014) - [j5]Marianna De Santis
Feasibility Pump-like heuristics for mixed integer problems. Discret. Appl. Math. 165: 152-167 (2014) - [i1]Marianna De Santis, Stefano Lucidi, Francesco Rinaldi:
A Fast Active Set Block Coordinate Descent Algorithm for ℓ1-regularized least squares. CoRR abs/1403.1738 (2014) - 2013
- [j4]Marianna De Santis
A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach. SIAM J. Optim. 23(3): 1575-1606 (2013) - [j3]Christoph Buchheim
An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations. SIAM J. Optim. 23(3): 1867-1889 (2013) - 2012
- [j2]Marianna De Santis
An active set feasible method for large-scale minimization problems with bound constraints. Comput. Optim. Appl. 53(2): 395-423 (2012) - [j1]Marianna De Santis
Continuous Reformulations for Zero-One Programming Problems. J. Optim. Theory Appl. 153(1): 75-84 (2012) - 2011
- [c2]Marianna De Santis, Stefano Lucidi, Francesco Rinaldi:
A New Feasibility Pump-Like Heuristic for Mixed Integer Problems. CTW 2011: 138-141 - [c1]Marianna De Santis, Stefano Lucidi, Francesco Rinaldi:
Continuous Reformulations for Zero-one Programming Problems. CTW 2011: 142-145
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: