A hop constrained min-sum arborescence with outage costs (Q875410): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2005.10.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2096032033
@@ Property / OpenAlex ID: W2096032033 / rank @@
+Normal rank
@@ Property / cites work @@
+A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
+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 @@
+Multicommodity flow models for spanning trees with hop constraints
+Normal rank
@@ Property / cites work @@
+Topological design of a centralized communication network with unreliable links and node outage costs
+Normal rank
@@ Property / cites work @@
+The Lagrangian Relaxation Method for Solving Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+A multiperiod degree constrained minimal spanning tree problem
+Normal rank
@@ Property / cites work @@
+A Lagrangean approach to the degree-constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
+Normal rank
@@ Property / cites work @@
+Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
+Normal rank
@@ Property / cites work @@
+Validation of subgradient optimization
@@ Property / cites work: Validation of subgradient optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4350039
@@ Property / cites work: Q4350039 / rank @@
+Normal rank