Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481061 | European Journal of Operational Research | 2010 | 5 Pages |
Abstract
This paper considers a tricriteria Steiner Tree Problem arising in the design of telecommunication networks. The objective functions consist of maximizing the revenue and of minimizing the maximal distance between each pair of interconnected nodes, as well as the maximal number of arcs between the root and each node. A polynomial algorithm is developed for the generation of a minimal complete set of Pareto-optimal Steiner trees. Optimality proofs are given and computational experience on a set of randomly generated problems is reported.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Leizer Lima Pinto, Gilbert Laporte,