The following pages link to Veronica Piccialli (Q301660):
Displaying 33 items.
- A game-theoretic approach to computation offloading in mobile cloud computing (Q301661) (← links)
- New global optimization methods for ship design problems (Q374643) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- (Q650226) (redirect page) (← links)
- A modified DIviding RECTangles algorithm for a problem in astrophysics (Q650229) (← links)
- Euclidean distance matrices, semidefinite programming and sensor network localization (Q716240) (← links)
- Decomposition algorithms for generalized potential games (Q763403) (← links)
- Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (Q839323) (← links)
- Generalized Nash equilibrium problems and Newton methods (Q959968) (← links)
- A magnetic resonance device designed via global optimization techniques (Q1764232) (← links)
- New classes of globally convexized filled functions for global optimization (Q1812075) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- A partition-based global optimization algorithm (Q1959242) (← links)
- Three methods for robust grading (Q1991142) (← links)
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems (Q2044489) (← links)
- Single courier single restaurant meal delivery (without routing) (Q2294375) (← links)
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems (Q2379688) (← links)
- A DIRECT-type approach for derivative-free constrained global optimization (Q2397821) (← links)
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization (Q2397824) (← links)
- Design of induction motors using a mixed-variable approach (Q2493263) (← links)
- On generalized Nash games and variational inequalities (Q2643788) (← links)
- A computational study on QP problems with general linear constraints (Q2673522) (← links)
- An exact algorithm for semi-supervised minimum sum-of-squares clustering (Q2676354) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
- A derivative-based algorithm for a particular class of mixed variable optimization problems (Q4657820) (← links)
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)
- An Algorithm Model for Mixed Variable Programming (Q5317537) (← links)
- Nonlinear optimization and support vector machines (Q5915690) (← links)
- Nonlinear optimization and support vector machines (Q5918754) (← links)
- SOS-SDP: an Exact Solver for Minimum Sum-of-Squares Clustering (Q6365959) (← links)
- An Exact Algorithm for Semi-supervised Minimum Sum-of-Squares Clustering (Q6384401) (← links)
- Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints (Q6417467) (← links)