Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights

DOI10.1007/978-3-642-00982-2_12zbMath1234.90015OpenAlexW1574578809MaRDI QIDQ3618576

Harald Hempel, Tobias Berg

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_12

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (9)

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 ⋮ Reoptimization of NP-Hard Problems ⋮ Unnamed Item ⋮ On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems ⋮ Reoptimization in machine scheduling ⋮ A note on the traveling salesman reoptimization problem under vertex insertion

Cites Work

• Matching theory
• Improved approximation algorithms for metric MaxTSP
• On the Hardness of Reoptimization
• Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights