Deterministic network interdiction (Q1804095): Difference between revisions

@@ Property / cites work @@
+Q5514188
@@ Property / cites work: Q5514188 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal interdiction of a supply network
@@ Property / cites work: Optimal interdiction of a supply network / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal interdiction policy for a flow network
@@ Property / cites work: Optimal interdiction policy for a flow network / rank @@
+Normal rank
@@ Property / cites work @@
+Removing Arcs from a Network
@@ Property / cites work: Removing Arcs from a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Determining the most vital link in a flow network
@@ Property / cites work: Determining the most vital link in a flow network / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the <i>n</i> Most Vital Links in Flow Networks
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+Facets of the knapsack polytope
@@ Property / cites work: Facets of the knapsack polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Edmonds polytopes and a hierarchy of combinatorial problems
+Normal rank