Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- 28 February 1991
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 30 (2-3) , 197-211
- https://doi.org/10.1016/0166-218x(91)90044-w
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Maximum andk-th maximal spanning trees of a weighted graphCombinatorica, 1987
- Linear verification for spanning treesCombinatorica, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- A note on Arc tolerances in sparse shortest‐path and network flow problemsNetworks, 1983
- Sensitivity analysis of minimum spanning trees and shortest path treesInformation Processing Letters, 1982
- Arc tolerances in shortest path and network flow problemsNetworks, 1980
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979
- Algorithms for updating minimal spanning treesJournal of Computer and System Sciences, 1978
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear ProgrammingManagement Science, 1977
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975