CINECA IRIS Institutional Research Information System

Sfoglia per Autore  

Opzioni
Mostrati risultati da 21 a 40 di 48
Titolo Data di pubblicazione Autore(i) File
Objective Function Features Providing Barriers to Rapid Global Optimization 2005 M. LOCATELLI; G. WOOD
On the multilevel structure of global optimization problems 2005 M. LOCATELLI
The global optimization of Morse clusters by potential transformations 2004 J. DOYE; R. LEARY; M. LOCATELLI; F. SCHOEN
Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches 2004 I. BOMZE; M. LOCATELLI
The combinatorics of pivoting for the maximum weight clique 2004 M. LOCATELLI; I. BOMZE; M. PELILLO
Experimental Analysys of a Population-Based Approach for Difficult Global Optimization Problems 2004 M. LOCATELLI; A.GROSSO; F. SCHOEN
Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem 2004 A. GROSSO; M. LOCATELLI; F. DELLA CROCE
Swap strategies for graph matching 2003 P.FOSSER; R.GLANTZ; M.LOCATELLI; M.PELILLO;
A note on the Griewank test function 2003 M. LOCATELLI
Efficient algorithms for large scale global optimization: Lennard-Jones clusters 2003 M. LOCATELLI; SCHOEN F
Minimal interatomic distance of Morse clusters 2002 M. LOCATELLI; SCHOEN F
Fast global optimization of difficult Lennard-Jones clusters 2002 M. LOCATELLI; SCHOEN F
review del libro "Optimal solution of nonlinear equations" di K. A. Sikorski, 2002 M. Locatelli
Packing equal circles into a square: a deterministic global optimization approach 2002 M. LOCATELLI; RABER U
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
Finite exact branch-and-bound algorithms for concave minimization over polytopes 2000 M. LOCATELLI; THOAI N.V
On the convergence of the simplicial branch-and-bound algorithm based on w-subdivisions 2000 M. LOCATELLI; RABER U
Simulated annealing algorithms for continuous global optimization: convergence conditio 2000 M. LOCATELLI
A finiteness result for the simplicial branch-and-bound algorithm based on w-subdivisions 2000 M. LOCATELLI; RABER U
Mostrati risultati da 21 a 40 di 48
Legenda icone

  •  file ad accesso aperto
  •  file disponibili sulla rete interna
  •  file disponibili agli utenti autorizzati
  •  file disponibili solo agli amministratori
  •  file sotto embargo
  •  nessun file disponibile