Solving The Maximum Flow Problem by Augmenting Flows on Subnetworks
碩士 === 國立成功大學 === 工業與資訊管理學系碩博士班 === 97 === The s-t maximum flow problem is a fundamental network optimization problem which computes for the largest amount of flow sent through a network from a source node s to a sink node t. This problem often appears in many business applications as an optimizatio...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/69957290971457543474 |