This thesis addresses combinatorial optimization problems with several objectives containing uncertain parameters. A variety of robustness concepts for multi-objective optimization problems have been developed during the last years. This thesis provides methods to find so-called robust efficient solutions with respect to several of these concepts, assuming the uncertain parameters to be given via common uncertainty sets. Several solution approaches are presented, including extensions and combinations of algorithms from both robust and multi-objective optimization, using properties of particular uncertainty sets and robustness concepts. Beyond general combinatorial optimization problems, the shortest path problem is considered in particular. Solution algorithms are implemented and evaluated in numerical experiments.
