DE SANTIS, MARIANNA

DE SANTIS, MARIANNA  

Ingegneria dell'Informazione  

Mostra records
Risultati 1 - 20 di 39 (tempo di esecuzione: 0.046 secondi).
Titolo Data di pubblicazione Autore(i) File
A decision space algorithm for multiobjective convex quadratic integer optimization 2021 De Santis M.; Eichfelder G.
A fast active set block coordinate descent algorithm for ℓ1-regularized least squares 2016 DE SANTIS, MARIANNA; LUCIDI, Stefano; Rinaldi, Francesco
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations 2015 Buchheim, Christoph; DE SANTIS, MARIANNA; PALAGI, Laura
A feasible active set method with reoptimization for convex quadratic mixed-integer programming 2016 Buchheim, Christoph; DE SANTIS, MARIANNA; LUCIDI, Stefano; Rinaldi, Francesco; Trieu, Long
A Frank–Wolfe based branch-and-bound algorithm for mean-risk optimization 2018 Christoph Buchheim; Marianna De Santis; Francesco Rinaldi; Long Trieu
A new class of functions for measuring solution integrality in the Feasibility Pump approach 2011 DE SANTIS M; Lucidi S; Rinaldi F
A new class of functions for measuring solution integrality in the feasibility pump approach 2013 DE SANTIS, MARIANNA; LUCIDI, Stefano; Francesco Rinaldi
A New Feasibility Pump-Like Heuristic for Mixed Integer Problems 2011 De Santis M; Lucidi S; Rinaldi F
A new feasibility pump-like heuristic for mixed integer problems 2011 DE SANTIS, MARIANNA; LUCIDI, Stefano; Rinaldi, F.
A Newton-type method for large scale minimization problems with bound constraints 2009 DE SANTIS M; DI PILLO G. AND LUCIDI S
A nonmonotone GRASP 2016 DE SANTIS, MARIANNA; Festa, P; Liuzzi, G.; LUCIDI, Stefano; Rinaldi, F.
A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems 2022 De Santis, M; de Vries, S; Schmidt, M; Winkel, L
A Two-Stage Active-Set Algorithm for Bound-Constrained Optimization 2017 CRISTOFARI, ANDREA; DE SANTIS, MARIANNA; LUCIDI, Stefano; Rinaldi, Francesco
An Active Set Algorithm for Robust Combinatorial Optimization Based on Separation Oracles 2019 Christoph Buchheim; Marianna De Santis
An active set feasible method for large-scale minimization problems with bound constraints 2012 DE SANTIS, MARIANNA; DI PILLO, Gianni; LUCIDI, Stefano
An active-set algorithmic framework for non-convex optimization problems over the simplex 2020 Cristofari A.; De Santis M.; Lucidi S.; Rinaldi F.
An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations 2013 C. Buchheim; DE SANTIS, MARIANNA; PALAGI, Laura; PIACENTINI, Mauro
An oracle-based framework for robust combinatorial optimization 2023 Bettiol E.; Buchheim C.; De Santis M.; Rinaldi F.
Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming 2019 Marianna De Santis; Giorgio Grani; Laura Palagi
Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming 2020 De Santis M.; Grani G.; Palagi L.