Home > Research > Publications & Outputs > A primal–dual simplex algorithm for bi-objectiv...

Research

Links

Text available via DOI:

View graph of relations

A primal–dual simplex algorithm for bi-objective network flow problems

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

Published

Standard

A primal–dual simplex algorithm for bi-objective network flow problems. / Eusébio, Augusto; Figueira, José Rui; Ehrgott, Matthias.
In: 4OR: A Quarterly Journal of Operations Research, Vol. 7, No. 3, 01.10.2009, p. 255-273.

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

Harvard

Eusébio, A, Figueira, JR & Ehrgott, M 2009, 'A primal–dual simplex algorithm for bi-objective network flow problems', 4OR: A Quarterly Journal of Operations Research, vol. 7, no. 3, pp. 255-273. https://doi.org/10.1007/s10288-008-0087-3

APA

Eusébio, A., Figueira, J. R., & Ehrgott, M. (2009). A primal–dual simplex algorithm for bi-objective network flow problems. 4OR: A Quarterly Journal of Operations Research, 7(3), 255-273. https://doi.org/10.1007/s10288-008-0087-3

Vancouver

Eusébio A, Figueira JR, Ehrgott M. A primal–dual simplex algorithm for bi-objective network flow problems. 4OR: A Quarterly Journal of Operations Research. 2009 Oct 1;7(3):255-273. doi: 10.1007/s10288-008-0087-3

Author

Eusébio, Augusto ; Figueira, José Rui ; Ehrgott, Matthias. / A primal–dual simplex algorithm for bi-objective network flow problems. In: 4OR: A Quarterly Journal of Operations Research. 2009 ; Vol. 7, No. 3. pp. 255-273.

Bibtex

@article{4a90e21740954ca9b706f69c84983ae5,
title = "A primal–dual simplex algorithm for bi-objective network flow problems",
abstract = "In this paper we develop a primal–dual simplex algorithm for the bi-objective linear minimum cost network flow problem. This algorithm improves the general primal–dual simplex algorithm for multi-objective linear programs by Ehrgott et al. (J Optim Theory Appl 134:483–497, 2007). We illustrate the algorithm with an example and provide numerical results.",
author = "Augusto Eus{\'e}bio and Figueira, {Jos{\'e} Rui} and Matthias Ehrgott",
year = "2009",
month = oct,
day = "1",
doi = "10.1007/s10288-008-0087-3",
language = "English",
volume = "7",
pages = "255--273",
journal = "4OR: A Quarterly Journal of Operations Research",
issn = "1619-4500",
publisher = "Springer Verlag",
number = "3",

}

RIS

TY - JOUR

T1 - A primal–dual simplex algorithm for bi-objective network flow problems

AU - Eusébio, Augusto

AU - Figueira, José Rui

AU - Ehrgott, Matthias

PY - 2009/10/1

Y1 - 2009/10/1

N2 - In this paper we develop a primal–dual simplex algorithm for the bi-objective linear minimum cost network flow problem. This algorithm improves the general primal–dual simplex algorithm for multi-objective linear programs by Ehrgott et al. (J Optim Theory Appl 134:483–497, 2007). We illustrate the algorithm with an example and provide numerical results.

AB - In this paper we develop a primal–dual simplex algorithm for the bi-objective linear minimum cost network flow problem. This algorithm improves the general primal–dual simplex algorithm for multi-objective linear programs by Ehrgott et al. (J Optim Theory Appl 134:483–497, 2007). We illustrate the algorithm with an example and provide numerical results.

U2 - 10.1007/s10288-008-0087-3

DO - 10.1007/s10288-008-0087-3

M3 - Journal article

VL - 7

SP - 255

EP - 273

JO - 4OR: A Quarterly Journal of Operations Research

JF - 4OR: A Quarterly Journal of Operations Research

SN - 1619-4500

IS - 3

ER -