The capacitated minimum spanning tree problem: revisiting hop-indexed formulations (Q1772873): Difference between revisions

@@ 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.1016/j.cor.2004.03.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2013912214
@@ Property / OpenAlex ID: W2013912214 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the capacitated tree problem
@@ Property / cites work: The complexity of the capacitated tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4944737
@@ Property / cites work: Q4944737 / rank @@
+Normal rank
@@ Property / cites work @@
+Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
+Normal rank
@@ Property / cites work @@
+Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
+Normal rank
@@ Property / cites work @@
+Q4845371
@@ Property / cites work: Q4845371 / rank @@
+Normal rank
@@ Property / cites work @@
+A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1772873