Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117): Difference between revisions

@@ Property / cites work @@
+Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
+Normal rank
@@ Property / cites work @@
+Q3470493
@@ Property / cites work: Q3470493 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for symmetric<i>K</i>-peripatetic salesman problems
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for symmetric 2-peripatetic salesman problems
+Normal rank
@@ Property / cites work @@
+On the generalized 2-peripatetic salesman problem
@@ Property / cites work: On the generalized 2-peripatetic salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q3714900
@@ Property / cites work: Q3714900 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4068472
@@ Property / cites work: Q4068472 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
+Normal rank
@@ Property / cites work @@
+Q3714901
@@ Property / cites work: Q3714901 / rank @@
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+A heuristic approach to the overnight security service problem
+Normal rank