Reducing the hierarchical network design problem (Q1121181): Difference between revisions

@@ Property / describes a project that uses @@
+Algorithm 97
@@ Property / describes a project that uses: Algorithm 97 / 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.1016/0377-2217(89)90170-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2065568963
@@ Property / OpenAlex ID: W2065568963 / rank @@
+Normal rank
@@ Property / cites work @@
+The hierarchical network design problem
@@ Property / cites work: The hierarchical network design problem / rank @@
+Normal rank
@@ Property / cites work @@
+Reduction tests for the steiner problem in grapsh
@@ Property / cites work: Reduction tests for the steiner problem in grapsh / rank @@
+Normal rank
@@ Property / cites work @@
+Some generalizations of the steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+An edge elimination test for the Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3690610
@@ Property / cites work: Q3690610 / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank