Approximation hardness of deadline-TSP reoptimization (Q1019743): Difference between revisions

@@ Property / cites work @@
+Reoptimizing the traveling salesman problem
@@ Property / cites work: Reoptimizing the traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
+Normal rank
@@ Property / cites work @@
+On the Approximation Hardness of Some Generalizations of TSP
+Normal rank
@@ Property / cites work @@
+The parameterized approximability of TSP with deadlines
+Normal rank
@@ Property / cites work @@
+Reoptimization of the Metric Deadline TSP
@@ Property / cites work: Reoptimization of the Metric Deadline TSP / rank @@
+Normal rank
@@ Property / cites work @@
+Q4532229
@@ Property / cites work: Q4532229 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4377042
@@ Property / cites work: Q4377042 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of postoptimality analysis of \(0/1\) programs
+Normal rank
@@ Property / cites work @@
+Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
+Normal rank
@@ Property / cites work @@
+Stability aspects of the traveling salesman problem based on \(k\)-best solutions
+Normal rank
@@ Property / cites work @@
+Some concepts of stability analysis in combinatorial optimization
+Normal rank