Pages that link to "Item:Q2448196"

The following pages link to Exact identification of critical nodes in sparse networks via new compact formulations (Q2448196):

Displaying 32 items.

• Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
• Methods for removing links in a network to minimize the spread of infections (Q342308) (← links)
• Bound and exact methods for assessing link vulnerability in complex networks (Q405658) (← links)
• An integer programming framework for critical elements detection in graphs (Q405684) (← links)
• Minimum cost edge blocker clique problem (Q827246) (← links)
• Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
• Improved formulations for minimum connectivity network interdiction problems (Q1652701) (← links)
• The bi-objective critical node detection problem (Q1681144) (← links)
• Compact models for critical node detection in telecommunication networks (Q1742251) (← links)
• Critical node identification for complex network based on a novel minimum connected dominating set (Q1746796) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections (Q1756351) (← links)
• Optimal detection of critical nodes: improvements to model structure and performance (Q2005802) (← links)
• EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
• Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
• Vulnerability analysis of interdependent network via integer programming approaches (Q2228378) (← links)
• Critical nodes in interdependent networks with deterministic and probabilistic cascading failures (Q2274858) (← links)
• Optimal \(K\)-node disruption on a node-capacitated network (Q2311104) (← links)
• A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← links)
• Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)
• The minimum cost network upgrade problem with maximum robustness to multiple node failures (Q2669557) (← links)
• A Region Growing Algorithm for Detecting Critical Nodes (Q2942434) (← links)
• A Fast Greedy Algorithm for the Critical Node Detection Problem (Q2942435) (← links)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)
• Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
• Finding Critical Links for Closeness Centrality (Q5138269) (← links)
• Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes (Q6066057) (← links)
• Content placement in 5G‐enabled edge/core data center networks resilient to link cut attacks (Q6066064) (← links)
• The stochastic critical node problem over trees (Q6092626) (← links)
• On designing networks resilient to clique blockers (Q6106962) (← links)
• A fast tri-individual memetic search approach for the distance-based critical node problem (Q6167524) (← links)