Login / Signup

A composite algorithm for a concave-cost network flow problem.

Anantharam BalakrishnanStephen C. Graves
Published in: Networks (1989)
Keyphrases
  • network flow problem
  • np hard
  • objective function
  • optimal solution
  • minimal cost
  • simulated annealing
  • computational complexity
  • probabilistic model
  • metaheuristic
  • ant colony optimization
  • transportation problem