Name
Title | ||
|---|---|---|
Relations, models and a memetic approach for three degree-dependent spanning tree problems. |
Abstract | ||
|---|---|---|
•We study three spanning tree problems with degree-dependent objective functions.•Finding the ST with fewest leaves is proven to be relevant for optical networks.•Several relations among the three problems are demonstrated.•We propose mathematical models and a memetic approach for the problems.•We show the effectivity of the proposed approach on test instances. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.ejor.2013.07.029 | European Journal of Operational Research |
Keywords | Field | DocType |
Combinatorial optimization,Memetic algorithms,Spanning trees,Optical networks | Memetic algorithm,Mathematical optimization,Distributed minimum spanning tree,Vertex (geometry),Euclidean minimum spanning tree,Combinatorial optimization,Spanning tree,Mathematics,Reverse-delete algorithm,Minimum spanning tree | Journal |
Volume | Issue | ISSN |
232 | 3 | 0377-2217 |
Citations | PageRank | References |
12 | 0.63 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Cerrone | 1 | 15 | 1.04 |
| R. Cerulli | 2 | 252 | 23.85 |
| A. Raiconi | 3 | 131 | 9.68 |