
Search the dblp DataBase
Andrea Grosso:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Nicoletta Ricciardi, Roberto Tadei, Andrea Grosso
Optimal facility location with random throughput costs. [Citation Graph (0, 0)][DBLP] Computers & OR, 2002, v:29, n:6, pp:593607 [Journal]
 Roberto Tadei, Andrea Grosso, Federico Della Croce
Finding the Paretooptima for the total and maximum tardiness single machine problem. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:124, n:13, pp:117126 [Journal]
 Andrea Grosso, Marco Locatelli, Federico Della Croce
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. [Citation Graph (0, 0)][DBLP] J. Heuristics, 2004, v:10, n:2, pp:135152 [Journal]
 Giuliana Carello, Federico Della Croce, Andrea Grosso, Marco Locatelli
A "maximum node clustering" problem. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2006, v:11, n:4, pp:373385 [Journal]
 Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos
Lower Bounds on the Approximation Ratios of Leading Heuristics for the SingleMachine Total Tardiness Problem. [Citation Graph (0, 0)][DBLP] J. Scheduling, 2004, v:7, n:1, pp:8591 [Journal]
 Andrea Grosso, Marco Locatelli, Fabio Schoen
A Populationbased Approach for Hard Global Optimization Problems based on Dissimilarity Measures. [Citation Graph (0, 0)][DBLP] Math. Program., 2007, v:110, n:2, pp:373404 [Journal]
A heuristic approach for the maxmin diversity problem based on maxclique. [Citation Graph (, )][DBLP]
Computational experience with a corebased reduction procedure for the 2knapsack problem. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs
