Prize collecting Steiner trees with node degree dependent costs

We discuss a variant of the prize-collecting Steiner tree problem with node degree dependent costs using a telecommunications setting to motivate these costs. We present and test models which are tailored for this variant of the problem. Results taken from instances with up to 100 nodes are used to...

Full description

Bibliographic Details
Main Author: Gouveia, Luís (author)
Other Authors: Moura, Pedro (author), Sousa, Amaro de (author)
Format: article
Language:eng
Published: 2011
Subjects:
Online Access:http://hdl.handle.net/10773/5188
Country:Portugal
Oai:oai:ria.ua.pt:10773/5188