Optimal procedures for the discrete time/cost trade-off problem in project networks
- 13 January 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 88 (1) , 50-68
- https://doi.org/10.1016/0377-2217(94)00181-2
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A Random Activity Network GeneratorOperations Research, 1993
- Solving time/cost trade-off problems with discounted cash flows using generalized benders decompositionNaval Research Logistics (NRL), 1993
- Optimal Reduction of Two-Terminal Directed Acyclic GraphsSIAM Journal on Computing, 1992
- Incremental modular decompositionJournal of the ACM, 1989
- A Fast Algorithm for the Decomposition of Graphs and PosetsMathematics of Operations Research, 1983
- On the measurement of complexity in activity networksEuropean Journal of Operational Research, 1980
- An algorithm for hierarchical reduction and decomposition of a directed graphComputing, 1980
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPMManagement Science, 1975
- Optimal design of centralized computer networksNetworks, 1971
- Optimal Design of Offshore Natural-Gas Pipeline SystemsOperations Research, 1970