Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2009.11.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2084317027
@@ Property / OpenAlex ID: W2084317027 / rank @@
+Normal rank
@@ Property / cites work @@
+The Capacitated <i>m</i>-Ring-Star Problem
@@ Property / cites work: The Capacitated <i>m</i>-Ring-Star Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Circuit Polytope: Facets
@@ Property / cites work: The Circuit Polytope: Facets / rank @@
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman 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 @@
+Column Generation Algorithms for the Capacitated m-Ring-Star Problem
+Normal rank
@@ Property / cites work @@
+The Ring Star Problem: Polyhedral analysis and exact algorithm
+Normal rank
@@ Property / cites work @@
+Q3836524
@@ Property / cites work: Q3836524 / rank @@
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
+Normal rank