Computing all efficient solutions of the biobjective minimum spanning tree problem.

Sarah Steiner Tomasz Radzik

Published in: Comput. Oper. Res. (2008)

Keyphrases

efficient solutions
bi objective
bicriteria
optimal solution
heuristic methods
set covering problem
minimum cost flow
pareto local search
pareto optimal solutions
multi objective
dynamic programming
network design