A MILP-based VND for the min-max regret shortest path tree problem with interval costs (Q1791906): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:41, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A MILP-based VND for the min-max regret shortest path tree problem with interval costs |
scientific article |
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
