On the stochastic complexity of the asymmetric traveling salesman problem (Q915656): Difference between revisions

@@ Property / cites work @@
+A restricted Lagrangean approach to the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Q3686500
@@ Property / cites work: Q3686500 / rank @@
+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 @@
+Q4151660
@@ Property / cites work: Q4151660 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of solving the assignment problem for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A new extension principle algorithm for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Random Trees and the Analysis of Branch and Bound Procedures
+Normal rank
@@ Property / cites work @@
+Q4138484
@@ Property / cites work: Q4138484 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3693257
@@ Property / cites work: Q3693257 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3945940
@@ Property / cites work: Q3945940 / rank @@
+Normal rank
@@ Property / cites work @@
+On some techniques useful for solution of transportation network problems
+Normal rank