A branch and bound algorithm for scheduling projects to maximize net present value: The case of time dependent, contingent cash flows (Q4245382)
From MaRDI portal
scientific article; zbMATH DE number 1297148
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for scheduling projects to maximize net present value: The case of time dependent, contingent cash flows |
scientific article; zbMATH DE number 1297148 |
Statements
A branch and bound algorithm for scheduling projects to maximize net present value: The case of time dependent, contingent cash flows (English)
0 references
5 October 1999
0 references
