- Tytuł:
- A note on the computation of ordered supported non-dominated solutions in the bi-criteria minimum spanning tree problems
- Autorzy:
-
Silva, C. G.
Cli'maco, J. C. N. - Powiązania:
- https://bibliotekanauki.pl/articles/308580.pdf
- Data publikacji:
- 2007
- Wydawca:
- Instytut Łączności - Państwowy Instytut Badawczy
- Tematy:
-
minimum spanning tree
supported non-dominated solutions
combinatorial problems - Opis:
- This paper presents a new procedure for computing the set of supported non dominated solutions of bi-criteria minimum spanning tree problems in ordered manner. The procedure is based on the systematic detection of edges which must be replaced in one efficient solution to obtain the adjacent one, in the criteria space. This new approach avoids solving unnecessary problems and makes use of previous computations.
- Źródło:
-
Journal of Telecommunications and Information Technology; 2007, 4; 11-15
1509-4553
1899-8852 - Pojawia się w:
- Journal of Telecommunications and Information Technology
- Dostawca treści:
- Biblioteka Nauki
Artykuł