Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
From MaRDI portal
Publication:3618576
DOI10.1007/978-3-642-00982-2_12zbMath1234.90015MaRDI QIDQ3618576
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
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
68W25: Approximation algorithms
Related Items
Unnamed Item, Reoptimization of maximum weight induced hereditary subgraph problems, On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems, A note on the traveling salesman reoptimization problem under vertex insertion, Robust reoptimization of Steiner trees, Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications, Reoptimization in machine scheduling
Cites Work