Minimum cost circulation problem with bounded number of edges
After I posted the question in cstheory, I received an answer there. 


  Your problem is NP-Hard and even hard to approximate via easy reductions from Steiner tree problem. Look at the following paper for more information. dl.acm.org/citation.cfm?doid=1077464.1077470.