Name
Abstract | ||
|---|---|---|
•We propose a generalization of the spanning forest problem.•Both reliability and cost are taken into account when designing the network.•MIP model and ALNS algorithm are developed to solve the problem.•Computational tests show the effectiveness of the solution methods. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.cie.2020.106365 | Computers & Industrial Engineering |
Keywords | DocType | Volume |
Networks,Minimum spanning forest,Reliability,Adaptive large neighborhood search | Journal | 142 |
Issue | ISSN | Citations |
C | 0360-8352 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ida Kalateh Ahani | 1 | 0 | 0.34 |
| Majid Salari | 2 | 152 | 10.08 |
| Seyed Mahmoud Hosseini | 3 | 1 | 1.38 |
| Manuel Iori | 4 | 790 | 46.05 |