Generalized multiple objective bottleneck problems

We consider multiple objective combinatorial optimization problems where one objective is of arbitrary type and the remaining objectives are bottleneck or k-max objectives. An efficient algorithm for the generation of the complete non-dominated set is developed, which implies polynomial time algorithms for shortest paths, spanning tree, and assignment problems, among others.