Solving the Biobjective Minimum Spanning Tree problem using a k-best algorithm

@inproceedings{Steiner2003SolvingTB,
  title={Solving the Biobjective Minimum Spanning Tree problem using a k-best algorithm},
  author={Sarah Steiner and Tomasz Radzik},
  year={2003}
}
We consider a two-phase method for computing the complete set of efficient solutions of the biobjective minimum spanning tree problem. The first phase computes the extreme efficient solutions by expanding the convex hull of the feasible space. The second phase repeatedly applies a k-best minimum spanning tree algorithm to find all nonextreme efficient solutions. We report results of our computational experiments comparing the performance of this method with another two-phase method, where the… CONTINUE READING
7 Citations
38 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 38 references

An algorithm for finding k minimum spanning trees

  • N Katoh, T Ibraki, H Mine
  • Siam Journal on Computing, 10(2):247–255,
  • 1981
Highly Influential
5 Excerpts

de la Cruz

  • L Mandow, J L Pére
  • Multicriteria heuristic search. European Journal…
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…