Search the dblp DataBase

Publications of Author

1. 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:593-607 [Journal]
   
2. Roberto Tadei, Andrea Grosso, Federico Della Croce
   Finding the Pareto-optima for the total and maximum tardiness single machine problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:124, n:1-3, pp:117-126 [Journal]
   
3. 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:135-152 [Journal]
   
4. 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:373-385 [Journal]
   
5. Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos
   Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem. [Citation Graph (0, 0)][DBLP]
   J. Scheduling, 2004, v:7, n:1, pp:85-91 [Journal]
   
6. Andrea Grosso, Marco Locatelli, Fabio Schoen
   A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures. [Citation Graph (0, 0)][DBLP]
   Math. Program., 2007, v:110, n:2, pp:373-404 [Journal]
   
7. 
   A heuristic approach for the max-min diversity problem based on max-clique. [Citation Graph (, )][DBLP]
   
   
8. 
   Computational experience with a core-based reduction procedure for the 2-knapsack problem. [Citation Graph (, )][DBLP]