A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (Q325449): Difference between revisions

@@ Property / cites work @@
+Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
+Normal rank
@@ Property / cites work @@
+md-MST is NP-hard for
@@ Property / cites work: md-MST is NP-hard for / rank @@
+Normal rank
@@ Property / cites work @@
+Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
+Normal rank
@@ Property / cites work @@
+The multi-weighted Steiner tree problem: A reformulation by intersection
+Normal rank
@@ Property / cites work @@
+Strong lower bounds for the prize collecting Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
+Normal rank
@@ Property / cites work @@
+VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
+Normal rank