Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds (Q5948202)
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 1667958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds |
scientific article; zbMATH DE number 1667958 |
Statements
Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds (English)
0 references
31 October 2001
0 references
0.9562439
0 references
0.9053642
0 references
0.8896058
0 references
0.8819393
0 references
0 references
