The robust minimum spanning tree problem: Compact and convex uncertainty

The robust minimum spanning tree problem: Compact and convex uncertainty

0.00 Avg rating—0 Votes
Article ID: iaor20073057
Country: Netherlands
Volume: 35
Issue: 1
Start Page Number: 17
End Page Number: 22
Publication Date: Jan 2007
Journal: Operations Research Letters
Authors:
Keywords: optimization
Abstract:

We consider the robust minimum spanning tree problem where edges costs are on a compact and convex subset of ℝn. We give the location of the robust deviation scenarios for a tree and characterizations of strictly strong edges and non-weak edges leading to recognition algorithms.

Reviews

Required fields are marked *. Your email address will not be published.