dc.contributor.author |
Raith, Andrea |
en |
dc.contributor.author |
Ehrgott, Matthias |
en |
dc.date.accessioned |
2011-12-05T20:00:58Z |
en |
dc.date.accessioned |
2015-05-28T05:02:02Z |
en |
dc.date.issued |
2009 |
en |
dc.identifier.citation |
Computers & Operations Research, 2009, 36 (6), pp. 1945 - 1954 (10) |
en |
dc.identifier.issn |
0305-0548 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/25660 |
en |
dc.description.abstract |
We present an algorithm to compute a complete set of efficient solutions for the biobjective integer minimum cost flow problem. We use the two phase method, with a parametric network simplex algorithm in phase 1 to compute all non-dominated extreme points. In phase 2, the remaining non-dominated points (non-extreme supported and non-supported) are computed using a k best flow algorithm on single-objective weighted sum problems. We implement the algorithm and report run-times on problem instances generated with a modified version of the NETGEN generator and also for networks with a grid structure. |
en |
dc.publisher |
Elsevier Ltd |
en |
dc.relation.ispartofseries |
Computers & Operations Research |
en |
dc.relation.replaces |
http://hdl.handle.net/2292/9787 |
en |
dc.relation.replaces |
2292/9787 |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from http://www.sherpa.ac.uk/romeo/issn/0305-0548/ |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.title |
A two-phase algorithm for the biobjective integer minimum cost flow problem |
en |
dc.type |
Journal Article |
en |
dc.identifier.doi |
10.1016/j.cor.2008.06.008 |
en |
pubs.issue |
6 |
en |
pubs.begin-page |
1945 |
en |
pubs.volume |
36 |
en |
dc.description.version |
Pre-print |
en |
dc.rights.holder |
Copyright:
Elsevier Ltd |
en |
pubs.author-url |
http://dl.acm.org/citation.cfm?id=1465908 |
en |
pubs.end-page |
1954 |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |
pubs.subtype |
Article |
en |
pubs.elements-id |
81669 |
en |
dc.relation.isnodouble |
4362 |
* |
pubs.org-id |
Engineering |
en |
pubs.org-id |
Engineering Science |
en |
pubs.record-created-at-source-date |
2010-09-01 |
en |