Article ID: | iaor19981846 |
Country: | Hungary |
Volume: | 17 |
Issue: | 34 |
Start Page Number: | 211 |
End Page Number: | 223 |
Publication Date: | Jan 1993 |
Journal: | Alkalmazott Matematikai Lapok |
Authors: | Klafszky Emil, Hajdu Mikls |
Keywords: | programming: network, networks: flow |
In this paper we give a fast, new algorithm for the Critical Path Method Time–Cost Trade-Offs problem. Starting from an optimal solution which corresponds to the maximal project duration, we can reach the optimal solution corresponding to a smaller project duration. The algorithm is based on network flow theory.