A MILP-based VND for the min-max regret shortest path tree problem with interval costs (Q1791906)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A MILP-based VND for the min-max regret shortest path tree problem with interval costs |
scientific article; zbMATH DE number 6951742
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A MILP-based VND for the min-max regret shortest path tree problem with interval costs |
scientific article; zbMATH DE number 6951742 |
Statements
A MILP-based VND for the min-max regret shortest path tree problem with interval costs (English)
0 references
11 October 2018
0 references
VND
0 references
integer programming
0 references
robust optimization
0 references
local search
0 references
0.8285532593727112
0 references
0.8046513795852661
0 references
0.7937195897102356
0 references
0.7897782325744629
0 references
0.7805235385894775
0 references
