Lagrangean bounds for the optimum communication spanning tree problem (Q611003): Difference between revisions

@@ Property / DOI @@
-.1007/s11750-009-0112-5
@@ Property / DOI: 10.1007/s11750-009-0112-5 / rank @@
-Normal rank
@@ Property / author @@
-Iván A. Contreras
@@ Property / author: Iván A. Contreras / rank @@
-Normal rank
@@ Property / author @@
+Iván A. Contreras
@@ Property / author: Iván A. Contreras / 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/s11750-009-0112-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2033487388
@@ Property / OpenAlex ID: W2033487388 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
+Normal rank
@@ Property / cites work @@
+Tight bounds from a path based formulation for the tree of hub location problem
+Normal rank
@@ Property / cites work @@
+The tree of hubs location problem
@@ Property / cites work: The tree of hubs location problem / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms for minimum routing cost trees
@@ Property / cites work: Exact algorithms for minimum routing cost trees / rank @@
+Normal rank
@@ Property / cites work @@
+Lagrangean relaxation. (With comments and rejoinder).
+Normal rank
@@ Property / cites work @@
+Q4742310
@@ Property / cites work: Q4742310 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the network design problem
@@ Property / cites work: The complexity of the network design problem / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
+Normal rank
@@ Property / cites work @@
+On Optimal Solutions for the Optimal Communication Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Algorithms for the optimum communication spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q4845371
@@ Property / cites work: Q4845371 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for some optimum communication spanning tree problems
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
+Normal rank
@@ Property / DOI @@
+.1007/S11750-009-0112-5
@@ Property / DOI: 10.1007/S11750-009-0112-5 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:611003