Network interdiction through length-bounded critical disruption paths: a bi-objective approach (Q325490): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+B10
@@ Property / Mathematics Subject Classification ID: 90B10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C11
@@ Property / Mathematics Subject Classification ID: 90C11 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C29
@@ Property / Mathematics Subject Classification ID: 90C29 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6640296
@@ Property / zbMATH DE Number: 6640296 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+network interdiction
@@ Property / zbMATH Keywords: network interdiction / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+multi-objective programming
@@ Property / zbMATH Keywords: multi-objective programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+mixed integer linear programming
@@ Property / zbMATH Keywords: mixed integer linear programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+critical disruption path
@@ Property / zbMATH Keywords: critical disruption path / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+connected components
@@ Property / zbMATH Keywords: connected components / rank @@
+Normal rank

Revision as of 02:51, 28 June 2023