LOCATELLI, Marco

LOCATELLI, Marco  

Mostra records
Risultati 1 - 20 di 47 (tempo di esecuzione: 0.024 secondi).
Titolo Data di pubblicazione Autore(i) File
A finiteness result for the simplicial branch-and-bound algorithm based on w-subdivisions 2000 M. LOCATELLI; RABER U
A heuristic approach for the max–min diversity problem based on max-clique 2009 F. DELLA CROCE; A. GROSSO; M. LOCATELLI
A maximum node clustering problem 2006 G. CARELLO; F. DELLA CROCE; A. GROSSO; M. LOCATELLI
A new class of test functions for global optimization 2007 B. ADDIS; M. LOCATELLI
A note on the Griewank test function 2003 M. LOCATELLI
A population based approach for hard global optimization problems based on dissimilarity measures 2007 A. GROSSO; M. LOCATELLI; F. SCHOEN
Adaptive deep brain stimulation controls levodopa-induced side effects in Parkinsonian patients 2017 Rosa, Manuela; Arlotti, Mattia; Marceglia, Sara; Cogiamanian, Filippo; Ardolino, Gianluca; Fonzo, Alessio Di; Lopiano, Leonardo; Scelzo, Emma; Merola, Aristide; Locatelli, Marco; Rampini, Paolo M.; Priori, Alberto
An adaptive stochastic global optimization algorithm for one-dimensional functions 1995 M. LOCATELLI; SCHOEN F
An experimental analysis of a population based approach for global optimization 2007 A. GROSSO; M. LOCATELLI; F. SCHOEN
Bayesian Algorithms for one-dimensional global optimization 1997 M. LOCATELLI
Bidimensional Packing by Bilinear Programming 2005 M. LOCATELLI; A. CAPRARA; M. MONACI
Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem 2004 A. GROSSO; M. LOCATELLI; F. DELLA CROCE
Complexity of the critical node problem over trees 2011 M. Di Summa; A. Grosso; M. Locatelli
Complexity results for some global optimization problems 2009 M. LOCATELLI
Convergence and first hitting time of simulated annealing algorithms for continuous global optimization 2001 M. LOCATELLI
Convergence of a simulated annealing algorithm for continuous global optimization 2000 M. LOCATELLI
Convergence properties of simulated annealing for continuous global optimization 1996 M. LOCATELLI
Disk packing in a square: a new global optimization approach 2008 B. ADDIS; M. LOCATELLI; F. SCHOEN
Efficient algorithms for large scale global optimization: Lennard-Jones clusters 2003 M. LOCATELLI; SCHOEN F
Efficiently packing unequal disks in a circle: a computational approach which exploits the continous and combinatorial structure of the problem 2008 B. ADDIS; M. LOCATELLI; F. SCHOEN