The following pages link to Marianna De Santis (Q510936):
Displayed 25 items.
- Item:Q510936 (redirect page) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Continuous reformulations for zero-one programming problems (Q415420) (← links)
- Dual approaches for a specific class of integer nonlinear programming problems (Q510937) (← links)
- An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
- A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization (Q1704920) (← links)
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations (Q1785386) (← links)
- An active set feasible method for large-scale minimization problems with bound constraints (Q1928749) (← links)
- Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) (← links)
- On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming (Q2157908) (← links)
- Improving ADMMs for solving doubly nonnegative programs through dual factorization (Q2240675) (← links)
- Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming (Q2286918) (← links)
- Using a factored dual in augmented Lagrangian methods for semidefinite programming (Q2294228) (← links)
- A two-stage active-set algorithm for bound-constrained optimization (Q2359771) (← links)
- Feasibility Pump-like heuristics for mixed integer problems (Q2448898) (← links)
- A decision space algorithm for multiobjective convex quadratic integer optimization (Q2669498) (← links)
- A Fast Active Set Block Coordinate Descent Algorithm for $\ell_1$-Regularized Least Squares (Q2796799) (← links)
- A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming (Q2817838) (← links)
- A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach (Q2866198) (← links)
- An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations (Q2866210) (← links)
- Solving Multiobjective Mixed Integer Convex Optimization Problems (Q5131967) (← links)
- An active set algorithm for robust combinatorial optimization based on separation oracles (Q5919428) (← links)
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective (Q6057717) (← links)
- An oracle-based framework for robust combinatorial optimization (Q6183084) (← links)
- Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems (Q6371068) (← links)