Reoptimization of minimum and maximum traveling salesman's tours (Q1044031): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2008.12.001
@@ Property / DOI: 10.1016/j.jda.2008.12.001 / rank @@
-Normal rank
@@ Property / author @@
-Bruno Escoffier
@@ Property / author: Bruno Escoffier / rank @@
-Normal rank
@@ Property / author @@
-Jérôme Monnot
@@ Property / author: Jérôme Monnot / rank @@
-Normal rank
@@ Property / author @@
-Vangelis Th. Paschos
@@ Property / author: Vangelis Th. Paschos / rank @@
-Normal rank
@@ Property / author @@
+Bruno Escoffier
@@ Property / author: Bruno Escoffier / rank @@
+Normal rank
@@ Property / author @@
+Jérôme Monnot
@@ Property / author: Jérôme Monnot / rank @@
+Normal rank
@@ Property / author @@
+Vangelis Th. Paschos
@@ Property / author: Vangelis Th. Paschos / rank @@
+Normal rank
@@ 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/j.jda.2008.12.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2043636453
@@ Property / OpenAlex ID: W2043636453 / rank @@
+Normal rank
@@ Property / cites work @@
+Reoptimizing the traveling salesman problem
@@ Property / cites work: Reoptimizing the traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q2906564
@@ Property / cites work: Q2906564 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3468865
@@ Property / cites work: Q3468865 / rank @@
+Normal rank
@@ Property / cites work @@
+Reoptimization of Steiner Trees
@@ Property / cites work: Reoptimization of Steiner Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Improved deterministic approximation algorithms for max TSP
+Normal rank
@@ Property / cites work @@
+Sparsification—a technique for speeding up dynamic graph algorithms
+Normal rank
@@ Property / cites work @@
+Q2867366
@@ Property / cites work: Q2867366 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations
@@ Property / cites work: The traveling salesman problem and its variations / rank @@
+Normal rank
@@ Property / cites work @@
+A \(\frac78\)-approximation algorithm for metric Max TSP
+Normal rank
@@ Property / cites work @@
+Maintaining minimum spanning trees in dynamic graphs
+Normal rank
@@ Property / cites work @@
+Q4365133
@@ Property / cites work: Q4365133 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146536
@@ Property / cites work: Q4146536 / rank @@
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Distances One and Two
+Normal rank
@@ Property / cites work @@
+An Analysis of Several Heuristics for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with forbidden sets
@@ Property / cites work: Scheduling with forbidden sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q3686457
@@ Property / cites work: Q3686457 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JDA.2008.12.001
@@ Property / DOI: 10.1016/J.JDA.2008.12.001 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1044031