Solving minimum-cost shared arborescence problems.

Eduardo Álvarez-Miranda Ivana Ljubic Martin Luipersbeck Markus Sinnl

Published in: Eur. J. Oper. Res. (2017)

Keyphrases

minimum cost
network flow problem
linear relaxation
minimum cost flow
np hard
network flow
approximation algorithms
optimization problems
path planning
capacity constraints