Article ID Journal Published Year Pages File Type
1143224 Operations Research Letters 2007 6 Pages PDF
Abstract

We consider the robust minimum spanning tree problem where edges costs are on a compact and convex subset of RnRn. 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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The robust minimum spanning tree problem: Compact and convex uncertainty
Authors
,