Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-012-9523-6
@@ Property / DOI: 10.1007/s10878-012-9523-6 / rank @@
-Normal rank
@@ Property / author @@
-Vladimir L. Boginski
@@ Property / author: Vladimir L. Boginski / rank @@
-Normal rank
@@ Property / author @@
-Eduardo L. Pasiliao
@@ Property / author: Eduardo L. Pasiliao / rank @@
-Normal rank
@@ Property / author @@
+Vladimir L. Boginski
@@ Property / author: Vladimir L. Boginski / rank @@
+Normal rank
@@ Property / author @@
+Eduardo L. Pasiliao
@@ Property / author: Eduardo L. Pasiliao / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+XPRESS
@@ Property / describes a project that uses: XPRESS / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CPLEX
@@ Property / describes a project that uses: CPLEX / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-012-9523-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2046654262
@@ Property / OpenAlex ID: W2046654262 / rank @@
+Normal rank
@@ Property / cites work @@
+Novel approaches for analyzing biological networks
+Normal rank
@@ Property / cites work @@
+A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
+Normal rank
@@ Property / cites work @@
+Edge-Connectivity Augmentation Preserving Simplicity
+Normal rank
@@ Property / cites work @@
+The \(k\) edge-disjoint 3-hop-constrained paths polytope
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
+Normal rank
@@ Property / cites work @@
+On the directed hop-constrained shortest path problem
+Normal rank
@@ Property / cites work @@
+On the \(k\) edge-disjoint 2-hop-constrained paths polytope
+Normal rank
@@ Property / cites work @@
+The 2-path network problem
@@ Property / cites work: The 2-path network problem / rank @@
+Normal rank
@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Simpler and faster biconnectivity augmentation
@@ Property / cites work: Simpler and faster biconnectivity augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting Graphs to Meet Edge-Connectivity Requirements
+Normal rank
@@ Property / cites work @@
+Minimal oriented graphs of diameter 2
@@ Property / cites work: Minimal oriented graphs of diameter 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Hop-constrained node survivable network design: An application to MPLS over WDM
+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 @@
+Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
+Normal rank
@@ Property / cites work @@
+Q2721988
@@ Property / cites work: Q2721988 / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
+Normal rank
@@ Property / cites work @@
+A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
+Normal rank
@@ Property / cites work @@
+On Critical Graphs of Diameter 2
@@ Property / cites work: On Critical Graphs of Diameter 2 / rank @@
+Normal rank
@@ Property / cites work @@
+New formulations and solution procedures for the hop constrained network design problem.
+Normal rank
@@ Property / cites work @@
+An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
+Normal rank
@@ Property / cites work @@
+Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
+Normal rank
@@ Property / cites work @@
+Robustness and Strong Attack Tolerance of Low-Diameter Networks
+Normal rank
@@ Property / DOI @@
+.1007/S10878-012-9523-6
@@ Property / DOI: 10.1007/S10878-012-9523-6 / rank @@
+Normal rank