Abstract
Given the minimum Hamiltonian path (or traveling salesman tour) H0 in an undirected weighted graph, the sensitivity analysis problem consists in finding by how much we can perturb each edge weight individually without changing the optimality of H0.The maximum increment and decrement of the edge weight that preserve the optimality of H0 is called edge tolerance with respect to the solution H0. A method of computing lower bounds of edge tolerances based on solving the sensitivity analysis problem for appropriate relaxations of the minimum Hamiltonian path and traveling salesman problems is presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
