Pages that link to "Item:Q1935569"

The following pages link to Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569):

Displaying 40 items.

• Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
• Minimum edge blocker dominating set problem (Q319914) (← links)
• A genetic algorithm for a class of critical node problems (Q325485) (← links)
• Network interdiction via a critical disruption path: branch-and-price algorithms (Q336604) (← links)
• A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
• A randomized algorithm with local search for containment of pandemic disease spread (Q337036) (← 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)
• The bi-objective critical node detection problem (Q1681144) (← links)
• Compact models for critical node detection in telecommunication networks (Q1742251) (← 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)
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226) (← 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)
• 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)
• Exact identification of critical nodes in sparse networks via new compact formulations (Q2448196) (← 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)
• Integer programming methods for solving binary interdiction games (Q2672065) (← links)
• Robust Critical Node Selection by Benders Decomposition (Q2806873) (← 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)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
• Critical node/edge detection problems on trees (Q6054014) (← 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)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
• On designing networks resilient to clique blockers (Q6106962) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• A fast tri-individual memetic search approach for the distance-based critical node problem (Q6167524) (← links)