On One Approach to TSP Structural Stability | Zendy

Evgeny Ivanko | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On One Approach to TSP Structural Stability

Author(s) -

Evgeny Ivanko

Publication year - 2014

Publication title -

advances in operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.379

H-Index - 14

eISSN - 1687-9155

pISSN - 1687-9147

DOI - 10.1155/2014/397025

Subject(s) - travelling salesman problem , vertex (graph theory) , stability (learning theory) , mathematical optimization , simple (philosophy) , enhanced data rates for gsm evolution , computer science , inverse , mathematics , theoretical computer science , artificial intelligence , graph , philosophy , geometry , epistemology , machine learning

In this paper we study an inverse approach to the traveling salesman reoptimization problem. Namely, we consider the case of the addition of a new vertex to the initial TSP data and fix the simple “adaptation” algorithm: the new vertex is inserted into an edge of the optimal tour. In the paper we consider the conditions describing the vertexes that can be inserted by this algorithm without loss of optimality, study the properties of stability areas, and address several model applications.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research