Table of Contents Author Guidelines Submit a Manuscript
Advances in Operations Research
Volume 2014, Article ID 397025, 8 pages
http://dx.doi.org/10.1155/2014/397025
Research Article

On One Approach to TSP Structural Stability

Institute of Mathematics and Mechanics, Russian Academy of Sciences, Ural Branch, S. Kovalevskoi 16, Ekaterinburg 620990, Russia

Received 19 January 2014; Revised 15 April 2014; Accepted 5 May 2014; Published 26 June 2014

Academic Editor: Walter J. Gutjahr

Copyright © 2014 Evgeny Ivanko. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. V. K. Leont'ev, “Stability of the travelling salesman problem,” USSR Computational Mathematics and Mathematical Physics, vol. 15, no. 5, pp. 199–213, 1975. View at Google Scholar · View at Scopus
  2. M. Libura, “Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems,” Discrete Applied Mathematics, vol. 30, no. 2-3, pp. 197–211, 1991. View at Publisher · View at Google Scholar
  3. È. N. Gordeev and V. K. Leont'ev, “A general approach to the study of the stability of solutions in discrete optimization problems,” Computational Mathematics and Mathematical Physics, vol. 36, no. 1, pp. 53–58, 1996. View at Google Scholar
  4. E. E. Gurevskiĭ and V. A. Emelichev, “On five types of stability of a lexicographic version of the combinatorial bottleneck problem,” Discrete Mathematics and Applications, vol. 19, no. 4, pp. 337–348, 2009. View at Publisher · View at Google Scholar
  5. M. Libura and Y. Nikulin, “Stability and accuracy functions in multicriteria linear combinatorial optimization problems,” Annals of Operations Research, vol. 147, no. 1, pp. 255–267, 2006. View at Publisher · View at Google Scholar
  6. M. V. Devyaterikova, A. A. Kolokolov, and N. A. Kosarev, “The analysis of the stability of some integer programming algorithms with respect to the objective function,” Russian Mathematics, vol. 55, no. 4, pp. 18–25, 2011. View at Publisher · View at Google Scholar · View at Scopus
  7. M. V. Devyaterikova and A. A. Kolokolov, “On the stability of some integer programming algorithms,” Operations Research Letters, vol. 34, no. 2, pp. 149–154, 2006. View at Publisher · View at Google Scholar · View at Scopus
  8. V. A. Emelichev and A. A. Platonov, “Measure of quasistability of a vector integer linear programming problem with generalized principle of optimality in the Helder metric,” Buletinul Academiei de Ştiinţe a Republicii Moldova: Matematica, vol. 2, pp. 58–67, 2008. View at Google Scholar
  9. L. N. Kozeratskaya, T. T. Lebedeva, and I. V. Sergienko, “Stability, parametric, and postoptimality analysis of discrete optimization problems,” Cybernetics, vol. 19, no. 4, pp. 522–535, 1983. View at Publisher · View at Google Scholar · View at Scopus
  10. C. M. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company, Reading, Mass, USA, 1994.
  11. V. G. Deĭneko, R. Rudolf, and G. J. Woeginger, “Sometimes travelling is easy: the master tour problem,” SIAM Journal on Discrete Mathematics, vol. 11, no. 1, pp. 81–93, 1998. View at Publisher · View at Google Scholar
  12. C. Archetti, L. Bertazzi, and M. G. Speranza, “Reoptimizing the traveling salesman problem,” Networks, vol. 42, no. 3, pp. 154–159, 2003. View at Publisher · View at Google Scholar
  13. A. Zych, Reoptimization of NP-hard problems [Ph.D. thesis], ETH Zurich, 2013.
  14. H. J. Bockenhauer, J. Hromkovic, T. Momke, and P. Widmayer, On the Hardness of Reoptimization, Springer, 2008.
  15. H. J. Bockenhauer, J. Hromkovic, and A. Sprock, “Knowing all optimal solutions does not help for tsp reoptimization,” in Computation, Cooperation and Life, vol. 42, pp. 7–15, 2011. View at Google Scholar
  16. E. Ivanko, “Sufficient conditions for tsp stability,” Proceedings of Institute of Mathematics and Mechanics of UBr RAS, vol. 3, pp. 155–168, 2011. View at Google Scholar
  17. E. Ivanko, “Criterion for tsp stability in case of a vertex addition, Herald of Udmurt University,” Herald of Udmurt University, Mathematics, Mechanics and Computer Science, vol. 1, pp. 58–66, 2011. View at Google Scholar
  18. E. Ivanko, Stability and Instability of Discrete Problems, PPD UBr RAS, Ekaterinburg, Russia, 2013.
  19. Tsplib, 2014, https://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.
  20. M. Held and R. M. Karp, “A dynamic programming approach to sequencing problems,” Journal of the Society for Industrial and Applied Mathematics, vol. 10, no. 1, pp. 196–210, 1962. View at Publisher · View at Google Scholar
  21. D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis, “Approximate algorithms for the traveling salesperson problem,” in Proceedings of the 15th Annual Symposium on Switching and Automata Theory, pp. 33–42, 1974. View at MathSciNet
  22. Concorde tsp solver, 2014, http://www.math.uwaterloo.ca/tsp/concorde.html.
  23. Qsopt linear programming solver, 2014, http://www.math.uwaterloo.ca/~bico/qsopt/.
  24. E. Ivanko, “Adaptive stability in combinatorial optimization problems,” Proceedings of Institute of Mathematics and Mechanics of UBr RAS, no. 1, pp. 100–108, 2014. View at Google Scholar