Show simple item record

dc.contributor.authorEnsor, A
dc.contributor.authorLillo, F
dc.date.accessioned2011-12-14T08:41:46Z
dc.date.available2011-12-14T08:41:46Z
dc.date.copyright2010
dc.date.issued2011-12-14
dc.identifier.citationLisbon 24th European Conference on Operations Research (EURO XXIV, Lisbon, Portugal, 2010-07-11 - 2010-07-14
dc.identifier.urihttp://hdl.handle.net/10292/3105
dc.description.abstractA weighted coloured-edge is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transportation modes. In such a graph paths are compared by their weight in each colour, resulting in a Pareto set of optimal paths from one vertex to another. This paper will give a tight upper bound on the cardinality of the Pareto set and explain some results toward establishing the average case cardinality.
dc.publisherAssociation of European Operational Research Societies
dc.relation.urihttp://euro2010lisbon.org/EUROXXIVProgramme.pdf
dc.rightsNOTICE: this is the author’s version of a work that was accepted for publication. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in (see Citation). The original publication is available at (see Publisher's Version)
dc.titleTight upper bound on the number of optimal paths in weighted coloured-edge graphs
dc.typeConference Contribution
dc.rights.accessrightsOpenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record