A two-phase algorithm for the biobjective integer minimum cost flow problem

Raith, Andrea; Ehrgott, Matthias

dc.contributor.author	Raith, Andrea	en
dc.contributor.author	Ehrgott, Matthias	en
dc.date.accessioned	2008-08-18T23:29:30Z	en
dc.date.available	2008-08-18T23:29:30Z	en
dc.date.issued	2007	en
dc.identifier.citation	Report University of Auckland School of Engineering 661, (2007)	en
dc.identifier.issn	0111-0136	en
dc.identifier.uri	http://hdl.handle.net/2292/2645	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 supported non-dominated extreme points. In phase 2, the remaining nondominated 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 some networks with grid structure.	en
dc.language.iso	en	en
dc.publisher	Faculty of Engineering, University of Auckland, New Zealand.	en
dc.relation.ispartofseries	Report (University of Auckland. Faculty of Engineering)	en
dc.relation.isreferencedby	UoA1826033	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.	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.subject.ddc	SERIALS Report School Eng	en
dc.title	A two-phase algorithm for the biobjective integer minimum cost flow problem	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::290000 Engineering and Technology	en
dc.rights.holder	Copyright: the author	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en
dc.relation.isnodouble	33928	*
pubs.org-id	Engineering	en