A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ (Q4546061): Difference between revisions

@@ Property / cites work @@
+Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Steiner Minimal Trees
@@ Property / cites work: Steiner Minimal Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for full Steiner trees
@@ Property / cites work: A linear time algorithm for full Steiner trees / rank @@
+Normal rank
@@ Property / cites work @@
+The shortest network under a given topology
@@ Property / cites work: The shortest network under a given topology / rank @@
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem
@@ Property / cites work: The Steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Growth conditions and \(U\)-Lagrangians
@@ Property / cites work: Growth conditions and \(U\)-Lagrangians / rank @@
+Normal rank
@@ Property / cites work @@
+The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation
+Normal rank
@@ Property / cites work @@
+Self-Scaled Barriers and Interior-Point Methods for Convex Programming
+Normal rank
@@ Property / cites work @@
+A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
+Normal rank
@@ Property / cites work @@
+How to find Steiner minimal trees in Euclidean \(d\)-space
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
+Normal rank