A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q1759849): Difference between revisions

@@ 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 @@
+On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Robust branch-and-cut-and-price for the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Column Generation Algorithms for the Capacitated m-Ring-Star Problem
+Normal rank
@@ Property / cites work @@
+The Shortest-Path Problem with  Resource Constraints and <i>k</i>-Cycle Elimination for <i>k</i> ≥ 3
+Normal rank
@@ Property / cites work @@
+Q5630824
@@ Property / cites work: Q5630824 / rank @@
+Normal rank
@@ Property / cites work @@
+A new branch-and-cut algorithm for the capacitated vehicle routing problem
+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 @@
+Q4452897
@@ Property / cites work: Q4452897 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4054818
@@ Property / cites work: Q4054818 / rank @@
+Normal rank