Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds (Q5948202): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PSPLIB / rank | |||
Normal rank | |||
Revision as of 00:32, 1 March 2024
scientific article; zbMATH DE number 1667958
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
