An iterative dynamic programming approach for the temporal knapsack problem (Q2030285)
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 7355867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative dynamic programming approach for the temporal knapsack problem |
scientific article; zbMATH DE number 7355867 |
Statements
An iterative dynamic programming approach for the temporal knapsack problem (English)
0 references
7 June 2021
0 references
temporal knapsack
0 references
exact algorithm
0 references
Lagrangian relaxation
0 references
successive sublimation dynamic programming method
0 references
0 references
0 references
0.8284884691238403
0 references
0.8241487741470337
0 references
0.761631429195404
0 references
0.7578485012054443
0 references
0.7573078870773315
0 references
