Cluster based branching for the asymmetric traveling salesman problem (Q1806732): Difference between revisions

@@ Property / describes a project that uses @@
+TSPLIB
@@ Property / describes a project that uses: TSPLIB / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A restricted Lagrangean approach to the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+Pathology of Traveling-Salesman Subtour-Elimination Algorithms
+Normal rank
@@ Property / cites work @@
+Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Technical Note—Bounds for the Travelling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+An Additive Bounding Procedure for Combinatorial Optimization Problems
+Normal rank
@@ Property / cites work @@
+An additive bounding procedure for the asymmetric travelling salesman problem
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
+Normal rank
@@ Property / cites work @@
+Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank