Tight upper bound on the number of optimal paths in weighted coloured-edge graphs
Tight upper bound on the number of optimal paths in weighted coloured-edge graphs
Files
Date
2010
Authors
Ensor, A
Lillo, F
Supervisor
Item type
Conference Contribution
Degree name
Journal Title
Journal ISSN
Volume Title
Publisher
Association of European Operational Research Societies
Abstract
A 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.
Description
Keywords
Source
Lisbon 24th European Conference on Operations Research (EURO XXIV, Lisbon, Portugal, 2010-07-11 - 2010-07-14
DOI
Publisher's version
Rights statement
NOTICE: 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)