Investigation on irreducible cost vectors in minimum cost arborescence problems.

Yoshifumi Kusunoki Tetsuzo Tanino

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

Keyphrases

minimum cost
network flow problem
np hard
minimum cost flow
linear relaxation
approximation algorithms
network flow
spanning tree
optimization problems
multi objective
np complete
minimum cost path
network simplex algorithm
search algorithm
supply chain