Login / Signup
Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem.
Mette Gamst
Peter Neergaard Jensen
David Pisinger
Christian Plum
Published in:
Eur. J. Oper. Res. (2010)
Keyphrases
</>
network flow problem
minimum cost
network flow
np hard
network simplex algorithm
approximation algorithms
capacity constraints
spanning tree
network design problem
mixed integer
index structure
minimal cost
special case
optimal solution
undirected graph
np complete
computational complexity