A MILP-based VND for the min-max regret shortest path tree problem with interval costs (Q1791906): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q129989386, #quickstatements; #temporary_batch_1725416833384 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Spanning Trees and Optimization Problems / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129989386 / rank | |||
Normal rank | |||
Latest revision as of 03:31, 4 September 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
