The robust minimum spanning tree problem: Compact and convex uncertainty

Authors:
Martha Salazar-Neumann
Affiliations:
Service de Mathématiques de la Gestion, Université Libre de Bruxelles, Boulevard du Triomphe - CP 210/01, B-1050 Bruxelles, Belgium
Venue:
Operations Research Letters
Year:
2007

Citing 3
Cited 1

Graph Theory With Applications

Graph Theory With Applications
On the complexity of the robust spanning tree problem with interval data

Operations Research Letters
The robust spanning tree problem with interval data

Operations Research Letters

The minimum risk spanning tree problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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