Salta al contenuto principale
English
Italiano
Form di ricerca
Cerca
legibility:
standard
|
enhanced
Dipartimento di Ingegneria informatica, automatica e gestionale
Toggle navigation
Dipartimento
Chi siamo
Governo
Pianificazione strategica
Assicurazione qualità
Dove siamo
Persone
Uffici
Trasparenza
Bandi
Commissioni
Strutture
Laboratori
Aule
Biblioteca
Didattica
Ricerca
Panoramica
Aree di ricerca
Gruppi di ricerca
Eventi e seminari
Progetti di ricerca
Keyword search
Visiting professors
Research Reports
DIAG Reports
Technical Reports
Centri interdipartimentali
Spin-off
Frequentatori esterni
Terza missione
Notizie
DIAG sui media
Seminars & events
Home
»
Tipologia Iris
»
01a Articolo Rivista
01a Articolo in rivista
Using SVM to combine global heuristics for the Standard Quadratic Problem
A new deterministic approach for transmission system planning in deregulated electricity markets
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
Modelling the Electrostatic Fluidised Bed (EFB) coating process using Support Vector Machines (SVMs)
An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
Unconstrained formulation of standard quadratic optimization problems
SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances
An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds
A truncated Newton method in an augmented Lagrangian framework for nonlinear programming
« prima
‹ precedente
…
324
325
326
327
328
329
330
331
332
…
seguente ›
ultima »
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma