Sfoglia per Autore
A new decomposition approach for the single-machine total tardiness problem
1998-01-01 TADEI R; DELLA CROCE F; BARACCO P; A. GROSSO
Solution of the single machine total tardiness problem
1999-01-01 SZWARC W; DELLA CROCE F; A. GROSSO
Logical topologies design over WDM wavelength-routed networks robust to traffic uncertainties
2001-01-01 A. GROSSO; LEONARDI E; MELLIA M; NUCCI A
Algorithmic paradoxes of the single machine total tardiness problem
2001-01-01 SZWARC W; A. GROSSO; DELLA CROCE F
Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic
2002-01-01 MELLIA M; NUCCI A; A. GROSSO; LEONARDI E; AJMONE MARSAN M
Optimal facility location with random throughput costs
2002-01-01 RICCIARDI N; TADEI R; A. GROSSO
Finding the Pareto optima for the total and maximum tardiness single machine scheduling problem
2002-01-01 TADEI R; A. GROSSO; DELLA CROCE F
Experimental Analysys of a Population-Based Approach for Difficult Global Optimization Problems
2004-01-01 M. LOCATELLI; A.GROSSO; F. SCHOEN
Combining swaps and nodes weighting in an adaptive greedy approach for the maximum clique problem
2004-01-01 A. GROSSO; M. LOCATELLI; F. DELLA CROCE
An enhanced dynasearch neighborhood for the single machine total weighted tardiness scheduling problem
2004-01-01 A. GROSSO; F. DELLA CROCE; R. TADEI
Lower bounds on the approximation ratios of leading heuristics for the single machine total tardiness scheduling problem
2004-01-01 A. GROSSO; F. DELLA CROCE; V. PASCHOS
A maximum node clustering problem
2006-01-01 G. CARELLO; F. DELLA CROCE; A. GROSSO; M. LOCATELLI
An experimental analysis of a population based approach for global optimization
2007-01-01 A. GROSSO; M. LOCATELLI; F. SCHOEN
A population based approach for hard global optimization problems based on dissimilarity measures
2007-01-01 A. GROSSO; M. LOCATELLI; F. SCHOEN
Simple ingredients leading to very efficient heuristics for the maximum clique problem
2008-01-01 A. GROSSO; M. LOCATELLI; W. PULLAN
A heuristic approach for the max–min diversity problem based on max-clique
2009-01-01 F. DELLA CROCE; A. GROSSO; M. LOCATELLI
Finding maximin latin hypercube designs by Iterated Local Search heuristics
2009-01-01 A. GROSSO; A.R.M.J.U. JAMALI; M. LOCATELLI
Solving molecular distance geometry problems by global optimization algorithms
2009-01-01 A. GROSSO; M. LOCATELLI; F. SCHOEN
Models for the optimal composition of medical crews in emergency services
2010-01-01 Bernardetta Addis; Roberto Aringhieri; Giuliana Carello; Andrea Grosso; Francesco Maffioli
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
2010-01-01 F. Della Croce ; T. Garaix ; A. Grosso
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