Optimal \(K\)-node disruption on a node-capacitated network (Q2311104): Difference between revisions

@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
+Normal rank
@@ Property / cites work @@
+Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
+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 @@
+Deterministic network interdiction
@@ Property / cites work: Deterministic network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest-path network interdiction
@@ Property / cites work: Shortest-path network interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+Exact identification of critical nodes in sparse networks via new compact formulations
+Normal rank
@@ Property / cites work @@
+Exact interdiction models and algorithms for disconnecting networks via node deletions
+Normal rank
@@ Property / cites work @@
+A cutting plane algorithm for computing \(k\)-edge survivability of a network
+Normal rank
@@ Property / cites work @@
+Computing Wardropian equilibria in a complementarity framework
+Normal rank
@@ Property / cites work @@
+Q3291948
@@ Property / cites work: Q3291948 / rank @@
+Normal rank
@@ Property / cites work @@
+The university of Florida sparse matrix collection
+Normal rank