1. Reoptimizing the traveling salesman problem;Archetti;Networks,2003
2. C. Archetti, L. Bertazzi, M.G. Speranza, Reoptimizing the 0–1 knapsack problem, Tech. Rep. 267, University of Brescia, 2006.
3. Reoptimization of minimum and maximum traveling salesmanʼs tours;Ausiello,2006
4. The Steiner problem with edge lengths 1 and 2;Bern;Information Processing Letters,1989
5. Reoptimization of Steiner trees;Bilò,2008