A branch and bound algorithm for scheduling projects to maximize net present value: The case of time dependent, contingent cash flows
From MaRDI portal
Publication:4245382
DOI10.1080/002075497194129zbMath0946.90522OpenAlexW2097410964MaRDI QIDQ4245382
Publication date: 5 October 1999
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/002075497194129
Related Items (6)
Maximizing the expected net present value in a project with uncertain cash flows ⋮ Optimizing version release dates of research and development long-term processes ⋮ Capital- and resource-constrained project scheduling with net present value optimization ⋮ Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models ⋮ Progress payments in project scheduling problems. ⋮ Simulated annealing and tabu search for multi-mode project payment scheduling
This page was built for publication: A branch and bound algorithm for scheduling projects to maximize net present value: The case of time dependent, contingent cash flows
