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...

In practice it is quite customary that an alternative is evaluated by means of n ≥ 2 grades x1, ..., xn, each of which taking an integer value from 1 («bad») to m ≥ 3 («perfect»). Thus, a problem arises to rank the set X of all n-dimensional vectors x with integer components from 1 to m....