Pages that link to "Item:Q1681144"

The following pages link to The bi-objective critical node detection problem (Q1681144):

Displaying 16 items.

• A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
• Efficient heuristic algorithm for identifying critical nodes in planar networks (Q1734834) (← links)
• The critical node detection problem in networks: a survey (Q1750314) (← links)
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226) (← links)
• Analysis of critical damage in the communication network. I: Model and computational experiment (Q1995357) (← 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)
• Multi-objective optimization model and evolutional solution of network node matching problem (Q2147883) (← links)
• Analysis of cluster damages in network systems (Q2206489) (← links)
• Analysis of critical damage in the communication network. III: Analysis of internode flows (Q2239212) (← links)
• The minimum cost network upgrade problem with maximum robustness to multiple node failures (Q2669557) (← links)
• Robust critical node selection by Benders decomposition (Q2806873) (← links)
• The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees (Q5012889) (← links)
• Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
• A fast tri-individual memetic search approach for the distance-based critical node problem (Q6167524) (← links)