Name
Abstract | ||
|---|---|---|
This paper deals with the Max-Mean Dispersion Problem (Max-Mean DP) belonging to the general category of clustering problems which aim to find a subset of a set which maximizes a measure of dispersion/similarity between elements. A three-phase hybrid heuristic was developed, which combines a mixed integer non-linear solver, a local branching scheme and a path relinking procedure. Computational results performed on the literature instances show that the proposed procedure outperforms the state-of-the-art approaches. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.cor.2016.01.003 | Computers & Operations Research |
Keywords | Field | DocType |
Max-Mean Dispersion Problem,Fractional combinatorial optimization,Quadratic binary programming,Hybrid heuristics | Integer,Dispersion (optics),Mathematical optimization,Heuristic,Statistical dispersion,Algorithm,Three-phase,Solver,Cluster analysis,Mathematics,Branching (version control) | Journal |
Volume | Issue | ISSN |
71 | C | 0305-0548 |
Citations | PageRank | References |
5 | 0.41 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Federico Della Croce | 1 | 399 | 41.60 |
| Michele Garraffa | 2 | 14 | 3.03 |
| Fabio Salassa | 3 | 56 | 9.79 |