Login / Signup

An application of randomized minimum cut to the project time/cost tradeoff problem.

Hamed Reza TareghianHassan Taheri
Published in: Appl. Math. Comput. (2006)
Keyphrases
  • minimum cut
  • maximum flow
  • graph cuts
  • weighted graph
  • graph partitioning
  • shortest path problem
  • min cut
  • multiscale
  • objective function
  • dynamic programming
  • mutual information
  • shortest path
  • long range