References
- AkkanCDrexlAKimmsANetwork decomposition-based benchmark results for the discrete time-cost tradeoff problemEur J Opl Res200516533935810.1016/j.ejor.2004.04.006
- BeinWWKamburowskiJStallmannMFMOptimal reduction of two-terminal directed acyclic graphsSIAM J Comput1992211112112910.1137/0221065
- ButcherWSDynamic programming for project cost-time curvesJ Construct Div-ASCE1967935973
- DePDunneEJGhoshJBWellsCEComplexity of the discrete time–cost tradeoff problem for project networksOpns Res19974530230610.1287/opre.45.2.302
- DeinekoVGWoegingerGJHardness of approximation of the discrete time–cost tradeoff problemOpns Res Lett20012920721010.1016/S0167-6377(01)00102-X
- DemeulemeesterEHerroelenWElmaghrabySEOptimal procedures for the discrete time/cost trade-off problem in project networksEur J Opl Res199688506810.1016/0377-2217(94)00181-2
- DemeulemeesterEDe ReyckBFoubertBHerroelenWVanhouckeMNew computational results on the discrete time/cost trade-off problem in project networksJ Opl Res Soc1998491153116310.1057/palgrave.jors.2600634
- ElmaghrabySEResource allocation via dynamic programming in activity networksEur J Opl Res19936419921510.1016/0377-2217(93)90177-O
- FulkersonDRA network flow computation for project cost curvesMngt Sci1961716717810.1287/mnsc.7.2.167
- KelleyJECritical-path planning and scheduling: Mathematical basisOpns Res1961929632010.1287/opre.9.3.296
- PhillipsSDessoukyMISolving the project time/cost tradeoff problem using the minimal cut conceptMngt Sci19772439339910.1287/mnsc.24.4.393
- RobinsonDRA dynamic programming solution to the cost–time tradeoff for CPMMngt Sci19752215816610.1287/mnsc.22.2.158
- SkutellaMApproximation algorithms for the discrete time–cost tradeoff problemMath Opns Res199823195203