Abstract
We consider a type of transportation problem with distribution centers. Solving this question by using auxiliary network: every distribution center in the transportation network is split into two nodes which are linked to form new arcs in the new network, enduing every arc with parameter vector, and turning this transportation problem into minimum cost flow problem. Basing on this point, the capacity expansion problem of the distribution centers and the paths in the transportation network are also considered in the article.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
