An enumeration algorithm for the Max-NPV problem with linear time-dependent cash flows
暂无分享,去创建一个
Mario Vanhoucke | W. Herroelen | E. Demeulemeester | M. Vanhoucke | W. Herroelen | E. Demeulemeester
[1] Salah E. Elmaghraby,et al. The scheduling of activities to maximize the net present value of projects , 1990 .
[2] C. Sepil,et al. Project Scheduling with Discounted Cash Flows and Progress Payments , 1996 .
[3] Erik Demeulemeester. An optimal recursive search procedure for the deterministic unconstrained max-nvp project scheduling problem , 1996 .
[4] A. Shtub,et al. A branch and bound algorithm for scheduling projects to maximize net present value: The case of time dependent, contingent cash flows , 1997 .
[5] C. Sepil,et al. Performance of the heuristic procedures for constrained projects with progress payments , 1997 .
[6] Erik Demeulemeester,et al. Project network models with discounted cash flows a guided tour through recent developments , 1997, Eur. J. Oper. Res..
[7] A. Shtub,et al. Scheduling projects to maximize net present value — the case of time-dependent, contingent cash flows , 1997 .
[8] R. Etgar. Scheduling project activities to maximize the net present value the case of linear time-dependent cash flows , 1999 .
[9] Erik Demeulemeester,et al. A classification scheme for project scheduling , 1999 .
[10] Erik Demeulemeester,et al. On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints , 2001, Manag. Sci..