Marianna De Santis

36 papers C 2Journal 33Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Quadratic convex reformulations for multiObjective binary quadratic programming.
J. Glob. Optim.
Marianna De Santis, Lucas Létocart, Yue Zhang
2025 J jnl
Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems.
4OR
Federico Battista, Marianna De Santis
2025 J jnl
Relax and penalize: a new bilevel approach to mixed-binary hyperparameter optimization.
Trans. Mach. Learn. Res.
Sara Venturini, Marianna De Santis, Jordan Patracone, Martin Schmidt, Francesco Rinaldi, Saverio Salzo
2025 J jnl
Using dual relaxations in multiobjective mixed-integer convex quadratic programming.
J. Glob. Optim.
Marianna De Santis, Gabriele Eichfelder, Daniele Patria, Leo Warnow
2024 J jnl
An oracle-based framework for robust combinatorial optimization.
J. Glob. Optim.
Enrico Bettiol, Christoph Buchheim, Marianna De Santis, Francesco Rinaldi
2024 J jnl
Designing sustainable diet plans by solving triobjective integer programs.
Math. Methods Oper. Res.
Luca Benvenuti, Alberto De Santis, Marianna De Santis, Daniele Patria
2024 J jnl
On Necessary Optimality Conditions for Sets of Points in Multiobjective Optimization.
J. Optim. Theory Appl.
Andrea Cristofari, Marianna De Santis, Stefano Lucidi
2023 J jnl
Relax and penalize: a new bilevel approach to mixed-binary hyperparameter optimization.
CoRR
Marianna De Santis, Jordan Frécon, Francesco Rinaldi, Saverio Salzo, Martin Schmidt
2022 J jnl
A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems.
INFORMS J. Comput.
Marianna De Santis, Sven de Vries, Martin Schmidt, Lukas Winkel
2022 J jnl
Minimization over the ℓ
Comput. Optim. Appl.
Andrea Cristofari, Marianna De Santis, Stefano Lucidi, Francesco Rinaldi
2022 J jnl
On the exactness of the
Oper. Res. Lett.
Marianna De Santis, Gabriele Eichfelder, Daniele Patria
2021 J jnl
A decision space algorithm for multiobjective convex quadratic integer optimization.
Comput. Oper. Res.
Marianna De Santis, Gabriele Eichfelder
2021 — conf
Design of a wearable device for physiological parameter monitoring in a COVID setting.
EMBC
Marianna De Santis, Eleonora Barcali, Y. Bardacci, L. Rasero, Stefano Bambi, Leonardo Bocchi
2021 J jnl
Improving ADMMs for solving doubly nonnegative programs through dual factorization.
4OR
Martina Cerulli, Marianna De Santis, Elisabeth Gaar, Angelika Wiegele
2021 J jnl
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective.
4OR
Michele Conforti, Marianna De Santis, Marco Di Summa, Francesco Rinaldi
2020 J jnl
An active-set algorithmic framework for non-convex optimization problems over the simplex.
Comput. Optim. Appl.
Andrea Cristofari, Marianna De Santis, Stefano Lucidi, Francesco Rinaldi
2020 J jnl
Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming.
Eur. J. Oper. Res.
Marianna De Santis, Giorgio Grani, Laura Palagi
2020 J jnl
Solving Multiobjective Mixed Integer Convex Optimization Problems.
SIAM J. Optim.
Marianna De Santis, Gabriele Eichfelder, Julia Niebling, Stefan Rocktäschel
2019 J jnl
An active set algorithm for robust combinatorial optimization based on separation oracles.
Math. Program. Comput.
Christoph Buchheim, Marianna De Santis
2018 J jnl
A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization.
J. Glob. Optim.
Christoph Buchheim, Marianna De Santis, Francesco Rinaldi, Long Trieu
2018 J jnl
Using a factored dual in augmented Lagrangian methods for semidefinite programming.
Oper. Res. Lett.
Marianna De Santis, Franz Rendl, Angelika Wiegele
2017 J jnl
A Two-Stage Active-Set Algorithm for Bound-Constrained Optimization.
J. Optim. Theory Appl.
Andrea Cristofari, Marianna De Santis, Stefano Lucidi, Francesco Rinaldi
2016 J jnl
A Fast Active Set Block Coordinate Descent Algorithm for ℓ
SIAM J. Optim.
Marianna De Santis, Stefano Lucidi, Francesco Rinaldi
2016 J jnl
A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming.
SIAM J. Optim.
Christoph Buchheim, Marianna De Santis, Stefano Lucidi, Francesco Rinaldi, Long Trieu
2016 J jnl
A nonmonotone GRASP.
Math. Program. Comput.
Marianna De Santis, Paola Festa, Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi
2016 J jnl
Dual approaches for a specific class of integer nonlinear programming problems.
Electron. Notes Discret. Math.
Marianna De Santis
2015 J jnl
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations.
Oper. Res. Lett.
Christoph Buchheim, Marianna De Santis, Laura Palagi
2014 J jnl
A Fast Active Set Block Coordinate Descent Algorithm for ℓ
CoRR
Marianna De Santis, Stefano Lucidi, Francesco Rinaldi
2014 J jnl
Combining optimization and machine learning techniques for genome-wide prediction of human cell cycle-regulated genes.
Bioinform.
Marianna De Santis, Francesco Rinaldi, Emmanuela Falcone, Stefano Lucidi, Giulia Piaggio, Aymone Gurtner, Lorenzo Farina
2014 J jnl
Feasibility Pump-like heuristics for mixed integer problems.
Discret. Appl. Math.
Marianna De Santis, Stefano Lucidi, Francesco Rinaldi
2013 J jnl
A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach.
SIAM J. Optim.
Marianna De Santis, Stefano Lucidi, Francesco Rinaldi
2013 J jnl
An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations.
SIAM J. Optim.
Christoph Buchheim, Marianna De Santis, Laura Palagi, Mauro Piacentini
2012 J jnl
An active set feasible method for large-scale minimization problems with bound constraints.
Comput. Optim. Appl.
Marianna De Santis, Gianni Di Pillo, Stefano Lucidi
2012 J jnl
Continuous Reformulations for Zero-One Programming Problems.
J. Optim. Theory Appl.
Marianna De Santis, Francesco Rinaldi
2011 C conf
A New Feasibility Pump-Like Heuristic for Mixed Integer Problems.
CTW
Marianna De Santis, Stefano Lucidi, Francesco Rinaldi
2011 C conf
Continuous Reformulations for Zero-one Programming Problems.
CTW
Marianna De Santis, Stefano Lucidi, Francesco Rinaldi