Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007): Difference between revisions
From MaRDI portal
Latest revision as of 17:09, 29 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem |
scientific article |
Statements
Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (English)
0 references
22 July 2022
0 references
dynamic programming
0 references
bounding
0 references
multi-profit orienteering problem
0 references
exact approach
0 references
0 references
0 references
0 references
0 references
0 references