In this paper a basic resource allocation problem with uncertain costs is discussed. The problem consists in choosing exactly p items out of n available to minimize the total cost. The uncertain item costs are specified as a discrete scenario set and the minmax criterion is used to choose a...

In this paper a basic resource allocation problem with uncertain costs is discussed. The problem consists in choosing exactly p items out of n available to minimize the total cost. The uncertain item costs are specified as a discrete scenario set and the minmax criterion is used to choose a...

In this paper a basic resource allocation problem with uncertain costs is discussed. The problem consists in choosing exactly p items out of n available to minimize the total cost. The uncertain item costs are specified as a discrete scenario set and the minmax criterion is used to choose a...

1. Introduction -- 2. Basic Concepts -- 3. Robust Problems -- 4. General Reformulation Results -- 5. General Solution Methods -- 6. Robust election Problems -- 7. Robust Shortest Path Problems -- 8. Robust Spanning Tree Problems -- 9. Other Combinatorial Problems -- 10. Other Models for Robust...

This paper analyses the problem of finding a robust spanning tree. The problem consists of determining a minimum spanning tree of a graph with uncertain edge costs. We should determine a spanning tree that minimizes the difference in costs between the tree selected and the optimal tree. While...