Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/44347
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Di Puglia Pugliese, Luigi | - |
dc.contributor.author | Guerriero, Francesca | - |
dc.contributor.author | Santos, José Luis | - |
dc.date.accessioned | 2017-11-13T12:21:47Z | - |
dc.date.issued | 2015 | - |
dc.identifier.issn | 1862-4472 (Print) 1862-4480 (Online) | por |
dc.identifier.uri | https://hdl.handle.net/10316/44347 | - |
dc.description.abstract | The aim of this paper is to provide a dynamic programming formulation for the spanning tree problem (ST P), which allows several instances of the classical ST P to be addressed. The spanning tree structure is modelled with states and transition between states, defining a state-space. Several properties are shown and optimality conditions are given. Once the theoretical fundamentals of the proposed formulation are derived, the multi-objective spanning tree problem (MOST P) is addressed. This problem arises in the telecommunications and transportation sectors. In these contexts, handling different criteria simultaneously plays a crucial role. The scientific literature provides several works that focus on the bi-objective version of the considered problem, in which only two criteria are taken into account. To the best of our knowledge, no works provide optimal methods to address theMOST P with an arbitrary number l of objective functions. In this paper we extend the proposed dynamic programming formulation to model and solve the MOST P with l ≥ 3 criteria. | por |
dc.language.iso | eng | por |
dc.publisher | Springer Berlin Heidelberg | por |
dc.rights | embargoedAccess | - |
dc.subject | Dynamic programming, Spanning tree problems, Multiple objective programming, Pareto front | por |
dc.title | Dynamic programming for spanning tree problems: application to the multi-objective case | por |
dc.type | article | - |
degois.publication.firstPage | 437 | por |
degois.publication.lastPage | 450 | por |
degois.publication.issue | 3 | por |
degois.publication.title | Optimization Letters | por |
dc.relation.publisherversion | https://link.springer.com/article/10.1007/s11590-014-0759-1 | por |
dc.peerreviewed | yes | por |
dc.identifier.doi | 10.1007/s11590-014-0759-1 | por |
dc.identifier.doi | 10.1007/s11590-014-0759-1 | - |
degois.publication.volume | 9 | por |
dc.date.embargo | 2018-11-13T12:21:47Z | - |
uc.controloAutoridade | Sim | - |
item.fulltext | Com Texto completo | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairetype | article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.author.dept | Faculty of Sciences and Technology | - |
crisitem.author.parentdept | University of Coimbra | - |
crisitem.author.researchunit | CMUC - Centre for Mathematics of the University of Coimbra | - |
crisitem.author.orcid | 0000-0002-2727-6774 | - |
Appears in Collections: | I&D CMUC - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
MOSTP-DP_revisto.pdf | 396.58 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.