Pages that link to "Item:Q1761226"

The following pages link to Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226):

Displaying 26 items.

• Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
• A genetic algorithm for a class of critical node problems (Q325485) (← 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)
• An integer programming framework for critical elements detection in graphs (Q405684) (← links)
• Parameterized complexity of critical node cuts (Q517024) (← links)
• Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
• The bi-objective critical node detection problem (Q1681144) (← links)
• Efficient heuristic algorithm for identifying critical nodes in planar networks (Q1734834) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• Literature review: the vaccine supply chain (Q1754311) (← links)
• EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
• A compact mixed integer linear formulation for safe set problems (Q2228393) (← links)
• Optimizing node infiltrations in complex networks by a local search based heuristic (Q2273672) (← 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)
• VNS solutions for the critical node problem (Q2631225) (← links)
• The minimum cost network upgrade problem with maximum robustness to multiple node failures (Q2669557) (← links)
• The connected critical node problem (Q2672625) (← 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)
• Critical node/edge detection problems on trees (Q6054014) (← links)
• A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
• A fast tri-individual memetic search approach for the distance-based critical node problem (Q6167524) (← links)