Publication
A primal-dual simplex algorithm for bi-objective network flow problems
| dc.contributor.author | Eusébio, Augusto | |
| dc.contributor.author | José Rui Figueira | |
| dc.contributor.author | Matthias Ehrgott | |
| dc.date.accessioned | 2025-04-04T15:18:11Z | |
| dc.date.available | 2025-04-04T15:18:11Z | |
| dc.date.issued | 2009-10 | |
| dc.description | MSC classification (2000) 90C29 · 90C35 | |
| dc.description.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. | eng |
| dc.identifier.citation | Eusébio, A., Figueira, J.R. & Ehrgott, M. A primal–dual simplex algorithm for bi-objective network flow problems. 4OR-Q J Oper Res 7, 255–273 (2009). https://doi.org/10.1007/s10288-008-0087-3 | |
| dc.identifier.doi | 10.1007/s10288-008-0087-3 | |
| dc.identifier.eissn | 1614-2411 | |
| dc.identifier.issn | 1619-4500 | |
| dc.identifier.uri | http://hdl.handle.net/10400.8/12757 | |
| dc.language.iso | eng | |
| dc.peerreviewed | yes | |
| dc.publisher | Springer | |
| dc.relation.hasversion | https://link.springer.com/article/10.1007/s10288-008-0087-3 | |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | |
| dc.subject | Multi-criteria optimization | |
| dc.subject | Multi-objective linear programming | |
| dc.subject | Network flow problem | |
| dc.subject | Primal–dual simplex algorithm | |
| dc.title | A primal-dual simplex algorithm for bi-objective network flow problems | eng |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 273 | |
| oaire.citation.issue | 3 | |
| oaire.citation.startPage | 255 | |
| oaire.citation.title | 4OR: A Quarterly Journal of Operations Research | |
| oaire.citation.volume | 7 | |
| oaire.version | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |
| person.familyName | Eusébio | |
| person.givenName | Augusto | |
| person.identifier.orcid | 0000-0002-6800-2016 | |
| person.identifier.scopus-author-id | 24779439000 | |
| relation.isAuthorOfPublication | e1266cbb-dcd0-47d5-92e8-1c345ea5e675 | |
| relation.isAuthorOfPublication.latestForDiscovery | e1266cbb-dcd0-47d5-92e8-1c345ea5e675 |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- A primal-dual simplex algorithm for bi-objective network flow problems.pdf
- Size:
- 381.91 KB
- Format:
- Adobe Portable Document Format
- Description:
- 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.
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.32 KB
- Format:
- Item-specific license agreed upon to submission
- Description: