A network simplex algorithm for the minimum distribution cost problem
碩士 === 國立成功大學 === 工業與資訊管理學系碩博士班 === 94 === The minimum cost flow problem seeks an optimal flow assignment over a network satisfying the node flow balance constraints and arc flow bounds constraints. These constraints are too simplified to model some real cases.To model the distillation or decomposit...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/29251223326455251674 |