Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2017.10.005
@@ Property / DOI: 10.1016/j.cor.2017.10.005 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2017.10.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2765289774
@@ Property / OpenAlex ID: W2765289774 / rank @@
+Normal rank
@@ Property / cites work @@
+Using a Hop-Constrained Model to Generate Alternative Communication Network Design
+Normal rank
@@ Property / cites work @@
+An algorithm for the resource constrained shortest path problem
+Normal rank
@@ Property / cites work @@
+Partitioning procedures for solving mixed-variables programming problems
+Normal rank
@@ Property / cites work @@
+A Benders decomposition based framework for solving cable trench problems
+Normal rank
@@ Property / cites work @@
+On implementing the push-relabel method for the maximum flow problem
+Normal rank
@@ Property / cites work @@
+Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
+Normal rank
@@ Property / cites work @@
+Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
+Normal rank
@@ Property / cites work @@
+On a measure of communication network vulnerability
+Normal rank
@@ Property / cites work @@
+An improved Benders decomposition applied to a multi-layer network design problem
+Normal rank
@@ Property / cites work @@
+Design of survivable networks with vulnerability constraints
+Normal rank
@@ Property / cites work @@
+Hop constrained Steiner trees with multiple root nodes
+Normal rank
@@ Property / cites work @@
+The two-level diameter constrained spanning tree problem
+Normal rank
@@ Property / cites work @@
+Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
+Normal rank
@@ Property / cites work @@
+Design of Survivable Networks: A survey
@@ Property / cites work: Design of Survivable Networks: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q5294061
@@ Property / cites work: Q5294061 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
+Normal rank
@@ Property / cites work @@
+Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+The complexity of finding two disjoint paths with min-max objective function
+Normal rank
@@ Property / cites work @@
+Hop‐level flow formulation for the survivable network design with hop constraints problem
+Normal rank
@@ Property / cites work @@
+A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2017.10.005
@@ Property / DOI: 10.1016/J.COR.2017.10.005 / rank @@
+Normal rank