Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/33368
Title: | Compact models for Critical Node Detection in telecommunication networks |
Author: | Santos, Dorabella Sousa, Amaro de Monteiro, Paulo |
Keywords: | Critical Node Detection Network vulnerability Mixed integer linear programming Optimization Telecommunication networks |
Issue Date: | Feb-2018 |
Publisher: | Elsevier |
Abstract: | Given a network defined by a graph, a weight associated to each node pair and a positive parameter p, the CND problem addressed here is to identify a set of at most p critical nodes minimizing the total weight of the node pairs that remain connected when all critical nodes are removed. We improve previously known compact models and present computational results, based on telecommunication backbone networks, showing that the proposed models are much more efficiently solved and enable us to obtain optimal solutions for networks up to 200 nodes and p values up to 20 critical nodes within a few minutes in the worst cases. |
Peer review: | yes |
URI: | http://hdl.handle.net/10773/33368 |
DOI: | 10.1016/j.endm.2018.02.007 |
ISSN: | 1571-0653 |
Appears in Collections: | DETI - Artigos IT - Artigos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
1-s2.0-S1571065318300349-main.pdf | Published version | 267.31 kB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.