On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453): 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.1007/s11590-014-0828-5
+Normal rank
@@ Property / OpenAlex ID @@
+W1983531822
@@ Property / OpenAlex ID: W1983531822 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of clause-learning SAT solvers as resolution engines
+Normal rank
@@ Property / cites work @@
+Q3425132
@@ Property / cites work: Q3425132 / rank @@
+Normal rank
@@ Property / cites work @@
+On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Q4790380
@@ Property / cites work: Q4790380 / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
+Normal rank
@@ Property / cites work @@
+An effective implementation of the Lin-Kernighan traveling salesman heuristic
+Normal rank
@@ Property / cites work @@
+General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
+Normal rank
@@ Property / cites work @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling salesman. Computational solutions for RSP applications
+Normal rank