| |
|
Description: |
In this talk a new algorithm for the multiobjective minimum spanning tree problem is presented. It is based on a label algorithm for the multiobjective shortest path problem in a transformed network and can be used with any number of criteria. Some restrictions are added to the paths (minimal paths) in order to obtain a one-to-one correspondence between trees in the original networks and minimal paths in the transformed network. A short example is presented as well as some computational experiments were reported showing that the proposed algorithm outperforms the others algorithms existing in the literature. A deep study is also done about the number of nondominated solutions and a statistical model is presented to predict its variation with the number of nodes and criteria.
|
|
Date: |
|
| Start Time: |
11:00 |
|
Speaker: |
José Luís Santos (CMUC, Univ. Coimbra)
|
|
Institution: |
CMUC, University of Coimbra
|
|
See more:
|
<Main>
<UC|UP MATH PhD Program>
|
|
