Scheduling a project to maximize its net present value: An integer programming approach (Q2366079)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 223234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling a project to maximize its net present value: An integer programming approach |
scientific article; zbMATH DE number 223234 |
Statements
Scheduling a project to maximize its net present value: An integer programming approach (English)
0 references
29 June 1993
0 references
project scheduling
0 references
resource limitations
0 references
net present value
0 references
depth-first branch and bound
0 references
0 references
0.8716249465942383
0 references
0.8525189161300659
0 references
0.8516244888305664
0 references
0.8482337594032288
0 references
