Login / Signup
A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks.
Ufuk Bahçeci
Orhan Feyzioglu
Published in:
Optim. Lett. (2012)
Keyphrases
</>
minimum cost
network flow problem
network flow
np hard
spanning tree
computational complexity
worst case
simulated annealing
linear programming
distance function
objective function
random graphs
minimal cost
minimum cost flow
combinatorial optimization
approximation ratio