A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. (Q1811625): Difference between revisions

@@ Property / cites work @@
+Q4065051
@@ Property / cites work: Q4065051 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Greedy randomized adaptive search procedures
@@ Property / cites work: Greedy randomized adaptive search procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q2776563
@@ Property / cites work: Q2776563 / rank @@
+Normal rank
@@ Property / cites work @@
+Topological design of telecommunication networks --- local access design methods
+Normal rank
@@ Property / cites work @@
+Q4354785
@@ Property / cites work: Q4354785 / rank @@
+Normal rank
@@ Property / cites work @@
+The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
+Normal rank
@@ Property / cites work @@
+Q4944737
@@ Property / cites work: Q4944737 / rank @@
+Normal rank
@@ Property / cites work @@
+A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0167-6377(02)00236-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2075677840
@@ Property / OpenAlex ID: W2075677840 / rank @@
+Normal rank