Improving connectivity of compromised digital networks via algebraic connectivity maximisation

DOI10.1016/J.EJOR.2021.01.015MaRDI QIDQ2031111zbMATH OpenOpenAlexFDO

Authors Kam-Fung Cheung, Michael G. H. Bell

Publication date 8 June 2021

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2021.01.015

zbMATH Keywords

heuristicsdecision analysisalgebraic connectivitycybersecurityreal-time recovery

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Minimax problems in mathematical programming (90C47) Connectivity (05C40) Transportation, logistics and supply chain management (90B06)

Recommendations

• Attacker-defender model against quantal response adversaries for cyber security in logistics management: an introductory study
• Model for resilient network design of fourth-party logistics with proactive attacks considered
• Optimizing algebraic connectivity by edge rewiring
• Reliable network design of third-party logistics under multi-grade proactive attacks
• Multi-period reliable network design of third-party logistics with proactive attack considered

Cites work

• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3337135 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• A maximum algebraic connectivity increment edge-based strategy for capacity enhancement in scale-free networks
• A survey of network interdiction models and algorithms
• Algorithms for synthesizing mechanical systems with maximal natural frequencies
• Applications of combinatorial matrix theory to Laplacian matrices of graphs
• Emergence of Scaling in Random Networks
• Matrix multiplication via arithmetic progressions
• Maximum algebraic connectivity augmentation is NP-hard
• Old and new results on algebraic connectivity of graphs
• Optimizing algebraic connectivity by edge rewiring
• Optimizing tabu list size for the traveling salesman problem
• Quantal response equilibria for normal form games
• Sequential interdiction with incomplete information and learning
• Tabu Search—Part I
• Tabu Search—Part II
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case

Cited in

(4)

• Efficient presolving methods for the influence maximization problem
• Attacker-defender model against quantal response adversaries for cyber security in logistics management: an introductory study
• Hypergraph analysis based on a compatible tensor product structure
• Effects on the algebraic connectivity of weighted graphs under edge rotations

Describes a project that uses

Uses Software

• YALMIP

This page was built for publication: Improving connectivity of compromised digital networks via algebraic connectivity maximisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2031111)