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...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2011
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/5188 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/5188 |
| Resumo: | 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. |
|---|