Stability analysis of the minimum spanning tree problem

MaRDI QIDQ5932935zbMATH OpenFDO

Authors Eh. N. Gordeev

Publication date 19 June 2001

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

stability analysisminimum spanning tree problemoptimization problem on matroids

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Stability analysis in optimization problems on matroids in the metric l₁
• Minimum spanning trees in networks with varying edge weights
• Stability of networks in stretchable graphs
• The probabilistic minimum spanning tree problem
• Path optimality conditions for minimum spanning tree problem with uncertain edge weights

Cited in

(9)

• scientific article; zbMATH DE number 62768 (Why is no real title available?)
• Stability analysis in optimization problems on matroids in the metric l₁
• Stability of networks in stretchable graphs
• Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry
• An application of the minimal spanning tree approach to the cluster stability problem
• Study on the stability of Steiner tree structure of explosion-proof textiles
• scientific article; zbMATH DE number 6965181 (Why is no real title available?)
• A rigorous analysis of the cavity equations for the minimum spanning tree
• On calculation of the stability radius for a minimum spanning tree

This page was built for publication: Stability analysis of the minimum spanning tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932935)