Hop constrained Steiner trees with multiple root nodes (Q299847): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57705360
@@ Property / Wikidata QID: Q57705360 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2013.11.029
+Normal rank
@@ Property / OpenAlex ID @@
+W2119678763
@@ Property / OpenAlex ID: W2119678763 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4325280
@@ Property / cites work: Q4325280 / rank @@
+Normal rank
@@ Property / cites work @@
+On implementing the push-relabel method for the maximum flow problem
+Normal rank
@@ Property / cites work @@
+Structure in Approximation Classes
@@ Property / cites work: Structure in Approximation Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q5294063
@@ Property / cites work: Q5294063 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
+Normal rank
@@ Property / cites work @@
+On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes
+Normal rank
@@ Property / cites work @@
+Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
+Normal rank
@@ Property / cites work @@
+A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
+Normal rank
@@ Property / cites work @@
+An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
+Normal rank
@@ Property / cites work @@
+Modeling and solving the rooted distance-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A new Lagrangean relaxation approach for the hop-constrained minimum 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 @@
+An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank