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...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Language: | eng |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10316/44347 |
| Country: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/44347 |