VNS solutions for the critical node problem (Q2631225): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2014.11.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2001250270
@@ Property / OpenAlex ID: W2001250270 / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting critical nodes in sparse graphs
@@ Property / cites work: Detecting critical nodes in sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
+Normal rank
@@ Property / cites work @@
+Identifying sets of key players in a social network
+Normal rank
@@ Property / cites work @@
+Complexity of the critical node problem over trees
+Normal rank
@@ Property / cites work @@
+Variable neighbourhood search: Methods and applications
+Normal rank
@@ Property / cites work @@
+Variable neighbourhood search: methods and applications
+Normal rank
@@ Property / cites work @@
+Exact interdiction models and algorithms for disconnecting networks via node deletions
+Normal rank
@@ Property / cites work @@
+Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
+Normal rank
@@ Property / cites work @@
+Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
+Normal rank
@@ Property / cites work @@
+Removing Arcs from a Network
@@ Property / cites work: Removing Arcs from a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic network interdiction
@@ Property / cites work: Deterministic network interdiction / rank @@
+Normal rank