| Article ID: | iaor20023424 |
| Country: | China |
| Volume: | 17 |
| Issue: | 2 |
| Start Page Number: | 85 |
| End Page Number: | 88 |
| Publication Date: | Jun 2001 |
| Journal: | Journal of Changsha Communications University |
| Authors: | Lu Hao, Wu Huanqun, Luo Yi |
A time-cost optimization model is given by means of introducing the min-cut max-flow theorem from network flows, and a solution to this model as well as a computer program is provided. The result shows that this method can solve time-cost optimization problems in a complex project plan.