01a Articolo in rivista | Department of Computer, Control and Management Engineering

01a Articolo in rivista

Dual approaches for a specific class of integer nonlinear programming problems
A fast active set block coordinate descent algorithm for ℓ1-regularized least squares
A nonmonotone GRASP

A greedy randomized adaptive search procedure (GRASP) is an itera- tive multistart metaheuristic for difficult combinatorial optimization problems. Each GRASP iteration consists of two phases: a construction phase, in which a feasible solution is produced, and a local search phase, in which a local...
A feasible active set method with reoptimization for convex quadratic mixed-integer programming
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
Feasibility Pump-like heuristics for mixed integer problems
Combining optimization and machine learning techniques for genome-wide prediction of human cell cycle-regulated genes
An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
A new class of functions for measuring solution integrality in the feasibility pump approach
An active set feasible method for large-scale minimization problems with bound constraints

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma