A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879)
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 7744682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty |
scientific article; zbMATH DE number 7744682 |
Statements
A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (English)
0 references
29 September 2023
0 references
minmax regret
0 references
interval uncertainty
0 references
single-source shortest path
0 references
metaheuristics
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
