| 2008 |
|---|
| 8 | EE | Andrea Grosso,
Marco Locatelli,
Wayne J. Pullan:
Simple ingredients leading to very efficient heuristics for the maximum clique problem.
J. Heuristics 14(6): 587-612 (2008) |
| 2007 |
|---|
| 7 | EE | Andrea Grosso,
Marco Locatelli,
Fabio Schoen:
A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures.
Math. Program. 110(2): 373-404 (2007) |
| 2006 |
|---|
| 6 | EE | Giuliana Carello,
Federico Della Croce,
Andrea Grosso,
Marco Locatelli:
A "maximum node clustering" problem.
J. Comb. Optim. 11(4): 373-385 (2006) |
| 2004 |
|---|
| 5 | EE | Andrea Grosso,
Marco Locatelli,
Federico Della Croce:
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem.
J. Heuristics 10(2): 135-152 (2004) |
| 4 | EE | Federico Della Croce,
Andrea Grosso,
Vangelis Th. Paschos:
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem.
J. Scheduling 7(1): 85-91 (2004) |
| 3 | EE | Andrea Grosso,
Federico Della Croce,
Roberto Tadei:
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem.
Oper. Res. Lett. 32(1): 68-72 (2004) |
| 2002 |
|---|
| 2 | EE | Nicoletta Ricciardi,
Roberto Tadei,
Andrea Grosso:
Optimal facility location with random throughput costs.
Computers & OR 29(6): 593-607 (2002) |
| 1 | | Roberto Tadei,
Andrea Grosso,
Federico Della Croce:
Finding the Pareto-optima for the total and maximum tardiness single machine problem.
Discrete Applied Mathematics 124(1-3): 117-126 (2002) |
