Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168): Difference between revisions

@@ 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 @@
+C57
@@ Property / Mathematics Subject Classification ID: 90C57 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6629781
@@ Property / zbMATH DE Number: 6629781 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+generalized network design
@@ Property / zbMATH Keywords: generalized network design / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+survivability
@@ Property / zbMATH Keywords: survivability / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+biconnectivity
@@ Property / zbMATH Keywords: biconnectivity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+branch-and-cut
@@ Property / zbMATH Keywords: branch-and-cut / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+mixed integer linear programming
@@ Property / zbMATH Keywords: mixed integer linear programming / rank @@
+Normal rank

Revision as of 01:00, 28 June 2023