Przybylski, A. and Gandibleux, X. and Ehrgott, M. (2010) A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme. INFORMS Journal on Computing, 22 (3). pp. 371-386. ISSN 1091-9856
Full text not available from this repository.Abstract
In this paper, we present two versions of an algorithm for the computation of all nondominated extreme points in the outcome set of a multiobjective integer programme. We define adjacency of these points based on weight space decomposition. Thus, our algorithms generalise the well-known dichotomic scheme to compute the set of nondominated extreme points in the outcome set of a biobjective programme. Both algorithms are illustrated with and numerically tested on instances of the assignment and knapsack problems with three objectives.