A note on the computation of ordered supported non-dominated solutions in the bi-criteria minimum spanning tree problems

Authors

  • Carlos Gomes da Silva
  • João C.N. Clímaco

DOI:

https://doi.org/10.26636/jtit.2007.4.845

Keywords:

minimum spanning tree, supported non-dominated solutions, combinatorial problems

Abstract

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.

Downloads

Download data is not yet available.

Downloads

Published

2007-12-30

Issue

No. 4 (2007)

Section

ARTICLES FROM THIS ISSUE

License

Copyright (c) 2023 Journal of Telecommunications and Information Technology

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
C. Gomes da Silva and J. C. Clímaco, “A note on the computation of ordered supported non-dominated solutions in the bi-criteria minimum spanning tree problems”, JTIT, vol. 30, no. 4, pp. 11–15, Dec. 2007, doi: 10.26636/jtit.2007.4.845.