Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem (Q623311): Difference between revisions

@@ Property / cites work @@
+A survey of very large-scale neighborhood search techniques
+Normal rank
@@ Property / cites work @@
+Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
+Normal rank
@@ Property / cites work @@
+The 2-hop spanning tree problem
@@ Property / cites work: The 2-hop spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5294063
@@ Property / cites work: Q5294063 / 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 @@
+Multicommodity flow models for spanning trees with hop constraints
+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 @@
+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 @@
+Extended neighborhood: Definition and characterization
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem with hop constraints
@@ Property / cites work: The Steiner tree problem with hop constraints / rank @@
+Normal rank