A New Feasibility Pump-Like Heuristic for Mixed Integer Problems. - Marianna De Santis; Stefano Lucidi; Francesco Rinaldi (CTW, 2011)

Continuous Reformulations for Zero-one Programming Problems. - Marianna De Santis; Stefano Lucidi; Francesco Rinaldi (CTW, 2011)

An active set feasible method for large-scale minimization problems with bound constraints. - Marianna De Santis; Gianni Di Pillo; Stefano Lucidi (Comput. Optim. Appl., 2012)

Continuous Reformulations for Zero-One Programming Problems. - Marianna De Santis; Francesco Rinaldi (J. Optim. Theory Appl., 2012)

An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations. - Christoph Buchheim; Marianna De Santis; Laura Palagi; Mauro Piacentini (SIAM J. Optim., 2013)

A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach. - Marianna De Santis; Stefano Lucidi; Francesco Rinaldi (SIAM J. Optim., 2013)

Combining optimization and machine learning techniques for genome-wide prediction of human cell cycle-regulated genes. - Marianna De Santis; Francesco Rinaldi; Emmanuela Falcone; Stefano Lucidi; Giulia Piaggio; Aymone Gurtner; Lorenzo Farina (Bioinform., 2014)

Feasibility Pump-like heuristics for mixed integer problems. - Marianna De Santis; Stefano Lucidi; Francesco Rinaldi (Discret. Appl. Math., 2014)

A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations. - Christoph Buchheim; Marianna De Santis; Laura Palagi (Oper. Res. Lett., 2015)

Dual approaches for a specific class of integer nonlinear programming problems. - Marianna De Santis (Electron. Notes Discret. Math., 2016)

A nonmonotone GRASP. - Marianna De Santis; Paola Festa; Giampaolo Liuzzi; Stefano Lucidi; Francesco Rinaldi (Math. Program. Comput., 2016)

A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming. - Christoph Buchheim; Marianna De Santis; Stefano Lucidi; Francesco Rinaldi; Long Trieu (SIAM J. Optim., 2016)

A Fast Active Set Block Coordinate Descent Algorithm for ℓ1-Regularized Least Squares. - Marianna De Santis; Stefano Lucidi; Francesco Rinaldi (SIAM J. Optim., 2016)

A Two-Stage Active-Set Algorithm for Bound-Constrained Optimization. - Andrea Cristofari; Marianna De Santis; Stefano Lucidi; Francesco Rinaldi (J. Optim. Theory Appl., 2017)

A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization. - Christoph Buchheim; Marianna De Santis; Francesco Rinaldi; Long Trieu (J. Glob. Optim., 2018)

Using a factored dual in augmented Lagrangian methods for semidefinite programming. - Marianna De Santis; Franz Rendl; Angelika Wiegele (Oper. Res. Lett., 2018)

An active set algorithm for robust combinatorial optimization based on separation oracles. - Christoph Buchheim; Marianna De Santis (Math. Program. Comput., 2019)

An active-set algorithmic framework for non-convex optimization problems over the simplex. - Andrea Cristofari; Marianna De Santis; Stefano Lucidi; Francesco Rinaldi (Comput. Optim. Appl., 2020)

Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming. - Marianna De Santis; Giorgio Grani; Laura Palagi (Eur. J. Oper. Res., 2020)

Solving Multiobjective Mixed Integer Convex Optimization Problems. - Marianna De Santis; Gabriele Eichfelder; Julia Niebling; Stefan Rocktäschel (SIAM J. Optim., 2020)

Design of a wearable device for physiological parameter monitoring in a COVID setting. - Marianna De Santis; Eleonora Barcali; Y. Bardacci; L. Rasero; Stefano Bambi; Leonardo Bocchi (EMBC, 2021)

Improving ADMMs for solving doubly nonnegative programs through dual factorization. - Martina Cerulli; Marianna De Santis; Elisabeth Gaar; Angelika Wiegele (4OR, 2021)

Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective. - Michele Conforti; Marianna De Santis; Marco Di Summa; Francesco Rinaldi (4OR, 2021)

A decision space algorithm for multiobjective convex quadratic integer optimization. - Marianna De Santis; Gabriele Eichfelder (Comput. Oper. Res., 2021)

Minimization over the ℓ 1-ball using an active-set non-monotone projected gradient. - Andrea Cristofari; Marianna De Santis; Stefano Lucidi; Francesco Rinaldi (Comput. Optim. Appl., 2022)

A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems. - Marianna De Santis; Sven de Vries; Martin Schmidt 003; Lukas Winkel (INFORMS J. Comput., 2022)

On the exactness of the ε-constraint method for biobjective nonlinear integer programming. - Marianna De Santis; Gabriele Eichfelder; Daniele Patria (Oper. Res. Lett., 2022)

Relax and penalize: a new bilevel approach to mixed-binary hyperparameter optimization. - Marianna De Santis; Jordan Frécon; Francesco Rinaldi; Saverio Salzo; Martin Schmidt 003 (CoRR, 2023)

An oracle-based framework for robust combinatorial optimization. - Enrico Bettiol; Christoph Buchheim; Marianna De Santis; Francesco Rinaldi (J. Glob. Optim., 2024)

On Necessary Optimality Conditions for Sets of Points in Multiobjective Optimization. - Andrea Cristofari; Marianna De Santis; Stefano Lucidi (J. Optim. Theory Appl., 2024)

Designing sustainable diet plans by solving triobjective integer programs. - Luca Benvenuti; Alberto De Santis; Marianna De Santis; Daniele Patria (Math. Methods Oper. Res., 2024)

Relax and penalize: a new bilevel approach to mixed-binary hyperparameter optimization. - Sara Venturini; Marianna De Santis; Jordan Patracone; Martin Schmidt 003; Francesco Rinaldi; Saverio Salzo (Trans. Mach. Learn. Res., 2025)

Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems. - Federico Battista; Marianna De Santis (4OR, 2025)

Using dual relaxations in multiobjective mixed-integer convex quadratic programming. - Marianna De Santis; Gabriele Eichfelder; Daniele Patria; Leo Warnow (J. Glob. Optim., 2025)