Sensitivity analysis of minimum spanning trees and shortest path trees
Reference (7)
Complexity of monotone networks of computing conjunctions
Annals Discrete Math.
(1978)- et al.
On computing least common ancestors in trees
SIAM J. Comput.
(1976) A note on arc tolerances in sparse shortest path and network flow problems
(1981)
There are more references available in the full text version of this article.
Cited by (129)
A network-based strategy of price correlations for optimal cryptocurrency portfolios
2023, Finance Research LettersAuction algorithm sensitivity for multi-robot task allocation
2023, AutomaticaAssessing the effect of multiple cost changes using reverse set tolerances
2022, Discrete Applied MathematicsCitation Excerpt :Furthermore, there are approaches for stability analysis in which one determines the largest ball around the current set of cost coefficients such that the current solution remains optimal [5,22]. However, most of these approaches require extensive computations, whereas single tolerance values can often be computed easily after an optimal solution has been obtained; see e.g. [19,24]. If it is possible to express the changes in multiple elements ’costs using single tolerance values, a decision-maker or an algorithm could assess the impact of such cost changes quickly.
Tropical Kirchhoff's formula and postoptimality in matroid optimization
2021, Discrete Applied MathematicsExtending single tolerances to set tolerances
2018, Discrete Applied Mathematics
Copyright © 1982 North-Holland. Published by Elsevier B.V. All rights reserved.