Home > Research > Publications & Outputs > A Recursive Algorithm for Finding All Nondomina...

Research

Links

Text available via DOI:

Keywords

View graph of relations

A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme. / Przybylski, A.; Gandibleux, X.; Ehrgott, M.
In: INFORMS Journal on Computing, Vol. 22, No. 3, 01.07.2010, p. 371-386.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Przybylski, A, Gandibleux, X & 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, vol. 22, no. 3, pp. 371-386. https://doi.org/10.1287/ijoc.1090.0342

APA

Przybylski, A., Gandibleux, X., & 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), 371-386. https://doi.org/10.1287/ijoc.1090.0342

Vancouver

Przybylski A, Gandibleux X, Ehrgott M. A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme. INFORMS Journal on Computing. 2010 Jul 1;22(3):371-386. doi: 10.1287/ijoc.1090.0342

Author

Przybylski, A. ; Gandibleux, X. ; Ehrgott, M. / A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme. In: INFORMS Journal on Computing. 2010 ; Vol. 22, No. 3. pp. 371-386.

Bibtex

@article{9964ded0f4a74bbe8ac6d68959832a4f,
title = "A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme",
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. ",
keywords = "multiobjective integer programme , efficient solution , weight space decomposition , nondominated extreme point",
author = "A. Przybylski and X. Gandibleux and M. Ehrgott",
year = "2010",
month = jul,
day = "1",
doi = "10.1287/ijoc.1090.0342",
language = "English",
volume = "22",
pages = "371--386",
journal = "INFORMS Journal on Computing",
issn = "1091-9856",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "3",

}

RIS

TY - JOUR

T1 - A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme

AU - Przybylski, A.

AU - Gandibleux, X.

AU - Ehrgott, M.

PY - 2010/7/1

Y1 - 2010/7/1

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

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

KW - multiobjective integer programme

KW - efficient solution

KW - weight space decomposition

KW - nondominated extreme point

U2 - 10.1287/ijoc.1090.0342

DO - 10.1287/ijoc.1090.0342

M3 - Journal article

VL - 22

SP - 371

EP - 386

JO - INFORMS Journal on Computing

JF - INFORMS Journal on Computing

SN - 1091-9856

IS - 3

ER -