Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications

New Algorithms for Steiner Tree Reoptimization

“…The term reoptimization was mentioned for the first time in the paper of Schäffter [35], where the author addressed an NP-hard scheduling problem with forbidden sets in the scenario of adding/removing a forbidden set. Since then, reoptimization has been successfully applied to other NP-hard problems including 1 : the Steiner tree problem [8, 11, 13-15, 31, 32, 37], the traveling salesman problem and some of its variants [1,5,7,12,[15][16][17][18][19]34], scheduling problems [6,21], the minimum latency problem [28,29], the minimum spanning tree problem [24], the rural postman problem [3], many covering problems [10], the shortest superstring problem [9], the knapsack problem [2], the maximum-weight induced hereditary subgraph problems [22], and the maximum P k subgraph problem [23]. Some overviews on other NP-hard reoptimization problems can be found in [4,25,36].…”