Dynamic programming for spanning tree problems: application to the multi-objective case
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 propert...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2015
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10316/44347 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/44347 |