scientific article
From MaRDI portal
Publication:3079180
zbMath1206.90134MaRDI QIDQ3079180
Luca Forlizzi, Joachim Kneis, Guido Proietti, Juraj Hromkovič, Joachim Kupke, Hans-Joachim Böckenhauer, Peter Widmayer
Publication date: 1 March 2011
Full work available at URL: http://journals.hil.unb.ca/index.php/AOR/article/view/2803/4688
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
traveling salesman problemapproximation algorithmsrelaxed triangle inequalitysharpened triangle inequalitylocal modifications
Related Items
Reoptimization of Steiner trees: changing the terminal set ⋮ A survey on combinatorial optimization in dynamic environments ⋮ Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions ⋮ Constant factor approximation algorithm for TSP satisfying a biased triangle inequality ⋮ Reoptimization of maximum weight induced hereditary subgraph problems ⋮ Robust reoptimization of Steiner trees ⋮ Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications ⋮ Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem ⋮ Unnamed Item ⋮ Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems ⋮ A theory and algorithms for combinatorial reoptimization ⋮ Reoptimization in machine scheduling ⋮ A note on the traveling salesman reoptimization problem under vertex insertion ⋮ Knowing All Optimal Solutions Does Not Help for TSP Reoptimization ⋮ Reoptimization of the metric deadline TSP ⋮ Reoptimization of the Metric Deadline TSP ⋮ Fast reoptimization for the minimum spanning tree problem ⋮ On the Hardness of Reoptimization ⋮ Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights ⋮ Structural Properties of Hard Metric TSP Inputs
