Name
Abstract | ||
|---|---|---|
This paper presents a new approach to solve the NP-complete minimumbranch vertices problem (MBV) introduced by Gargano et. al[1]. In spite of being a recently proposed problem in the network optimization literature, there are some heuristics to solve it [3]. The main contribution of this paper consists in a new heuristic based on the iterative refinement approach proposed by Deo and Kumar [2]. The experimental results suggest that this approach is capable of finding solutions that are better than the best known in the literature. In thiswork, for instance, the proposed heuristic found better solutions for 78% of the instances tested. The heuristic looks very promising for the solution of problems related with constrained spanning trees. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-20662-7_36 | SEA |
Keywords | Field | DocType |
main contribution,minimum branch vertices problem,gargano et,new heuristic,iterative refinement algorithm,iterative refinement approach,proposed heuristic,network optimization literature,better solution,new approach,spanning tree | Iterative refinement,Mathematical optimization,Heuristic,Vertex (geometry),Computer science,Algorithm,Heuristics,Spanning tree | Conference |
Volume | ISSN | Citations |
6630 | 0302-9743 | 5 |
PageRank | References | Authors |
0.45 | 5 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Diego M. Silva | 1 | 12 | 0.99 |
| Ricardo M. A. Silva | 2 | 65 | 9.02 |
| Geraldo R. Mateus | 3 | 134 | 13.00 |
| José F. Gonçalves | 4 | 10 | 0.86 |
| Mauricio G. C. Resende | 5 | 3729 | 336.98 |
| Paola Festa | 6 | 287 | 25.32 |