Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem (Q1824571): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0305-0548(90)90034-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2090944138
@@ Property / OpenAlex ID: W2090944138 / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
+Normal rank
@@ Property / cites work @@
+Note—On the Use of Fictitious Bounds in Tree Search Algorithms
+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 @@
+The traveling salesman problem: A duality approach
+Normal rank
@@ Property / cites work @@
+On Some Generalizations of the Travelling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Nonoptimal Edges for the Symmetric Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
+Normal rank
@@ Property / cites work @@
+Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
+Normal rank