4.5 Article

The minimum cost network upgrade problem with maximum robustness to multiple node failures

Related references

Note: Only part of the references are listed.
Article Telecommunications

A Pareto frontier for node survivable computer network design problem

Ali Hadian et al.

Summary: In a survivable network design problem in cloud computing, minimizing the network building costs and maximizing the technical capability of the network are two important goals. The previous studies focused on only one of these goals, but this paper develops a new model that considers both goals as a two-objective optimization problem. Multiple two-objective optimization procedures are used to solve the problem and the results are discussed, followed by numerical simulations for two real examples.

TELECOMMUNICATION SYSTEMS (2021)

Article Automation & Control Systems

Network Structural Vulnerability: A Multiobjective Attacker Perspective

Luca Faramondi et al.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2019)

Article Computer Science, Interdisciplinary Applications

Efficient heuristic algorithm for identifying critical nodes in planar networks

Dalaijargal Purevsuren et al.

COMPUTERS & OPERATIONS RESEARCH (2019)

Article Computer Science, Information Systems

Infrastructure upgrade framework for Content Delivery Networks robust to targeted attacks

Carlos Natalino et al.

OPTICAL SWITCHING AND NETWORKING (2019)

Article Management

The bi-objective critical node detection problem

Mario Ventresca et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2018)

Review Computer Science, Information Systems

The Critical Node Detection Problem in networks: A survey

Mohammed Lalou et al.

COMPUTER SCIENCE REVIEW (2018)

Article Mathematics, Applied

Component-cardinality-constrained critical node problem in graphs

M. Lalou et al.

DISCRETE APPLIED MATHEMATICS (2016)

Article Operations Research & Management Science

Exact identification of critical nodes in sparse networks via new compact formulations

Alexander Veremyev et al.

OPTIMIZATION LETTERS (2014)

Article Operations Research & Management Science

Branch and cut algorithms for detecting critical nodes in undirected graphs

Marco Di Summa et al.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2012)

Article Computer Science, Interdisciplinary Applications

Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem

Mario Ventresca

COMPUTERS & OPERATIONS RESEARCH (2012)

Article Operations Research & Management Science

Exact interdiction models and algorithms for disconnecting networks via node deletions

Siqian Shen et al.

DISCRETE OPTIMIZATION (2012)

Article Computer Science, Interdisciplinary Applications

Complexity of the critical node problem over trees

Marco Di Summa et al.

COMPUTERS & OPERATIONS RESEARCH (2011)

Article Computer Science, Hardware & Architecture

SNDlib 1.0-Survivable Network Design Library

S. Orlowski et al.

NETWORKS (2010)

Article Computer Science, Interdisciplinary Applications

Detecting critical nodes in sparse graphs

Ashwin Arulselvan et al.

COMPUTERS & OPERATIONS RESEARCH (2009)

Article Management

On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods

Pradyumn Kumar Shukla et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)

Article Computer Science, Interdisciplinary Applications

Hierarchical generation of Pareto optimal solutions in large-scale multiobjective systems

R Caballero et al.

COMPUTERS & OPERATIONS RESEARCH (2002)