A study of complexity transitions on the asymmetric traveling salesman problem (Q2674187): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0004-3702(95)00054-2
+Normal rank
@@ Property / OpenAlex ID @@
+W1983101156
@@ Property / OpenAlex ID: W1983101156 / rank @@
+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 @@
+Q3682518
@@ Property / cites work: Q3682518 / rank @@
+Normal rank
@@ Property / cites work @@
+Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4012216
@@ Property / cites work: Q4012216 / rank @@
+Normal rank
@@ Property / cites work @@
+On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Q5615180
@@ Property / cites work: Q5615180 / rank @@
+Normal rank
@@ Property / cites work @@
+Searching for an optimal path in a tree with random costs
+Normal rank
@@ Property / cites work @@
+Q3707785
@@ Property / cites work: Q3707785 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-Bound Methods: A Survey
@@ Property / cites work: Branch-and-Bound Methods: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—On the Expected Performance of Branch-and-Bound Algorithms
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Traveling Salesman Problem
@@ Property / cites work: An Algorithm for the Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5581642
@@ Property / cites work: Q5581642 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3972640
@@ Property / cites work: Q3972640 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012185
@@ Property / cites work: Q4012185 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Random Trees and the Analysis of Branch and Bound Procedures
+Normal rank
@@ Property / cites work @@
+Exploiting the deep structure of constraint problems
+Normal rank
@@ Property / cites work @@
+Performance of linear-space search algorithms
@@ Property / cites work: Performance of linear-space search algorithms / rank @@
+Normal rank