Stability analysis of the minimum spanning tree problem
From MaRDI portal
Publication:5932935
zbMath0964.90040MaRDI QIDQ5932935
Publication date: 19 June 2001
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)
Related Items (2)
Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry ⋮ Unnamed Item
This page was built for publication: Stability analysis of the minimum spanning tree problem