On one approach to TSP structural stability

DOI10.1155/2014/397025zbMath1291.90204OpenAlexW2064041810WikidataQ59047861 ScholiaQ59047861MaRDI QIDQ2248701

Evgeny Ivanko

Publication date: 27 June 2014

Published in: Advances in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/397025

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• The analysis of the stability of some integer programming algorithms with respect to the objective function
• A general approach to the study of the stability of solutions in discrete optimization problems
• Stability and accuracy functions in multicriteria linear combinatorial optimization problems
• On the stability of some integer programming algorithms
• Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
• Criterion of the stability of optimal route in the travelling salesman problem in case of a single vertex addition
• Knowing All Optimal Solutions Does Not Help for TSP Reoptimization
• Stability, parametric, and postoptimality analysis of discrete optimization problems
• On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
• A Dynamic Programming Approach to Sequencing Problems
• Sometimes Travelling is Easy: The Master Tour Problem
• Reoptimizing the traveling salesman problem

This page was built for publication: On one approach to TSP structural stability