The global search algorithms in minimum cost flow problem with concave costs
碩士 === 國立中央大學 === 土木工程研究所 === 90 === The minimum cost transshipment problems are traditionally formulated as a linear cost problem, in order to reduce problem complexity. In reality, the unit cost decreases as the amount transported increases, resulting in a concave cost function. Recently, a rese...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/35650856338064084785 |