Hop‐level flow formulation for the survivable network design with hop constraints problem (Q5326786): Difference between revisions

@@ Property / cites work @@
+The \(k\) edge-disjoint 3-hop-constrained paths polytope
+Normal rank
@@ Property / cites work @@
+Notes on polyhedra associated with hop-constrained paths
+Normal rank
@@ Property / cites work @@
+On the \(k\) edge-disjoint 2-hop-constrained paths polytope
+Normal rank
@@ Property / cites work @@
+Multicommodity flow models for spanning trees with hop constraints
+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 @@
+The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
+Normal rank
@@ Property / cites work @@
+Integer programming formulations for the two 4-hop-constrained paths problem
+Normal rank
@@ Property / cites work @@
+Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
+Normal rank
@@ Property / cites work @@
+The complexity of finding maximum disjoint paths with length constraints
+Normal rank
@@ Property / cites work @@
+Design of Survivable Networks: A survey
@@ Property / cites work: Design of Survivable Networks: A survey / rank @@
+Normal rank