Pages that link to "Item:Q405684"

The following pages link to An integer programming framework for critical elements detection in graphs (Q405684):

Displaying 34 items.

• Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
• Minimum edge blocker dominating set problem (Q319914) (← links)
• Methods for removing links in a network to minimize the spread of infections (Q342308) (← links)
• Minimum cost edge blocker clique problem (Q827246) (← links)
• Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
• Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
• Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
• Improved formulations for minimum connectivity network interdiction problems (Q1652701) (← links)
• The bi-objective critical node detection problem (Q1681144) (← links)
• Wildfire fuel management: network-based models and optimization of prescribed burning (Q1681542) (← 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)
• Complexity of the multilevel critical node problem (Q2121476) (← links)
• Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
• A compact mixed integer linear formulation for safe set problems (Q2228393) (← links)
• Graph signatures: identification and optimization (Q2242325) (← links)
• Critical nodes in interdependent networks with deterministic and probabilistic cascading failures (Q2274858) (← 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)
• Integer programming methods for solving binary interdiction games (Q2672065) (← links)
• The connected critical node problem (Q2672625) (← 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)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• Fortification Against Cascade Propagation Under Uncertainty (Q5084610) (← links)
• Finding Critical Links for Closeness Centrality (Q5138269) (← links)
• Critical node/edge detection problems on trees (Q6054014) (← 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)