The discrete time-cost tradeoff problem revisited
- 1 March 1995
- journal article
- review article
- Published by Elsevier in European Journal of Operational Research
- Vol. 81 (2) , 225-238
- https://doi.org/10.1016/0377-2217(94)00187-h
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Resource allocation via dynamic programming in activity networksEuropean Journal of Operational Research, 1993
- Optimal Reduction of Two-Terminal Directed Acyclic GraphsSIAM Journal on Computing, 1992
- Heuristic Estimation of the Efficient Frontier for a Bi-Criteria Scheduling ProblemDecision Sciences, 1992
- An Applications Oriented Guide to Lagrangian RelaxationInterfaces, 1985
- A Fast Algorithm for the Decomposition of Graphs and PosetsMathematics of Operations Research, 1983
- A Dynamic Programming Algorithm for Decision CPM NetworksOperations Research, 1979
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Decision CPM: Network Reduction and SolutionJournal of the Operational Research Society, 1970
- Decision CPM: A Method for Simultaneous Planning, Scheduling, and Control of ProjectsOperations Research, 1967
- A Network Flow Computation for Project Cost CurvesManagement Science, 1961