Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood (Q1805008): Difference between revisions

@@ Property / author @@
-Rainer E. Burkard
@@ Property / author: Rainer E. Burkard / rank @@
-Normal rank
@@ Property / author @@
-Vladimir G. Deǐneko
@@ Property / author: Vladimir G. Deǐneko / rank @@
-Normal rank
@@ Property / author @@
+Rainer E. Burkard
@@ Property / author: Rainer E. Burkard / rank @@
+Normal rank
@@ Property / author @@
+Vladimir G. Deǐneko
@@ Property / author: Vladimir G. Deǐneko / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric applications of a matrix-searching algorithm
+Normal rank
@@ Property / cites work @@
+The optimum assignments and a new heuristic approach for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A new heuristic for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Sequence comparison with mixed convex and concave costs
+Normal rank
@@ Property / cites work @@
+Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q3768703
@@ Property / cites work: Q3768703 / rank @@
+Normal rank
@@ Property / cites work @@
+A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4120276
@@ Property / cites work: Q4120276 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ Property / cites work @@
+A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
+Normal rank
@@ Property / cites work @@
+Q4170156
@@ Property / cites work: Q4170156 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3932608
@@ Property / cites work: Q3932608 / rank @@
+Normal rank