A branch-and-cut algorithm for two-level survivable network design problems (Q342262): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+B10
@@ Property / Mathematics Subject Classification ID: 90B10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B25
@@ Property / Mathematics Subject Classification ID: 90B25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C11
@@ Property / Mathematics Subject Classification ID: 90C11 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6654124
@@ Property / zbMATH DE Number: 6654124 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+network design
@@ Property / zbMATH Keywords: network design / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+survivability
@@ Property / zbMATH Keywords: survivability / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+hierarchical networks
@@ Property / zbMATH Keywords: hierarchical networks / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+valid inequalities
@@ Property / zbMATH Keywords: valid inequalities / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+branch-and-cut
@@ Property / zbMATH Keywords: branch-and-cut / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2134932236
@@ Property / OpenAlex ID: W2134932236 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:342262