Repositório Institucional da Universidade de Aveiro > Departamento de Electrónica, Telecomunicações e Informática > DETI - Artigos >
 Prize collecting Steiner trees with node degree dependent costs
Please use this identifier to cite or link to this item http://hdl.handle.net/10773/5188

title: Prize collecting Steiner trees with node degree dependent costs
authors: Gouveia, Luís
Moura, Pedro
Sousa, Amaro de
keywords: Steiner trees
Degree constraints
Valid inequalities
issue date: Jan-2011
publisher: Elsevier
abstract: 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 evaluate the quality of the proposed models for solving the problem, as well as, in terms of the correspondent linear programming relaxation.
URI: http://hdl.handle.net/10773/5188
ISSN: 0305-0548
source: Computers and Operations Research
appears in collectionsDETI - Artigos

files in this item

file description sizeformat
CAOR_FinalPaper.pdfArtigo publicado357.32 kBAdobe PDFview/open
Restrict Access. You can Request a copy!

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! RCAAP OpenAIRE DeGóis
ria-repositorio@ua.pt - Copyright ©   Universidade de Aveiro - RIA Statistics - Powered by MIT's DSpace software, Version 1.6.2