![](images/graphics/blank.gif)
A dual exterior point simplex type algorithm for the minimum cost network flow problem
44
lượt xem 0
download
lượt xem 0
download
![](https://tailieu.vn/static/b2013az/templates/version1/default/images/down16x21.png)
A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs to a special “exteriorpoint simplex type” category. Similarly to the classical network dual simplex algorithm (NDSA), this algorithm starts with a dual feasible tree-solution and reduces the primal infeasibility, iteration by iteration.
Chủ đề:
Bình luận(0) Đăng nhập để gửi bình luận!
![](images/graphics/blank.gif)
CÓ THỂ BẠN MUỐN DOWNLOAD