Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q113875419, #quickstatements; #temporary_batch_1711439739529 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2022.02.045 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4214554976 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q113875419 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:08, 26 March 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
