Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach

In this paper we propose a new method to solve biobjective combinatorial optimization problems of the max-ordering type. The method is based on the two-phases method and ranking algorithms to efficiently construct K-best solutions for the underlying (single objective) combinatorial problem. We show that the method overcomes some of the difficulties of procedures proposed earlier. We illustrate this by an example and discuss the difficulties in extending it to more than two objectives.