Name
Title | ||
|---|---|---|
A two-level solution approach for solving the generalized minimum spanning tree problem. |
Abstract | ||
|---|---|---|
•We focus on the generalized version of the minimum spanning tree problem.•We describe a two-level solution approach for solving this problem.•Our method is obtained by decomposing the problem into two smaller subproblems.•Extensive computational results are reported and discussed.•The obtained results show an improvement in the quality of the achieved solutions. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.ejor.2017.08.015 | European Journal of Operational Research |
Keywords | Field | DocType |
Combinatorial optimization,Generalized minimum spanning tree problem,Genetic algorithms,Decomposition methods,Dynamic programming | Discrete mathematics,Mathematical optimization,Combinatorics,Distributed minimum spanning tree,k-minimum spanning tree,Prim's algorithm,Euclidean minimum spanning tree,Spanning tree,Mathematics,Reverse-delete algorithm,Kruskal's algorithm,Minimum spanning tree | Journal |
Volume | Issue | ISSN |
265 | 2 | 0377-2217 |
Citations | PageRank | References |
5 | 0.43 | 23 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Petrica C. Pop | 1 | 183 | 27.86 |
| Oliviu Matei | 2 | 43 | 11.15 |
| C. Sabo | 3 | 19 | 2.50 |
| Adrian Petrovan | 4 | 5 | 0.43 |