Algorithms for the minmax regret path problem with interval data (Q2198244)
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: Algorithms for the minmax regret path problem with interval data |
scientific article; zbMATH DE number 7245720
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the minmax regret path problem with interval data |
scientific article; zbMATH DE number 7245720 |
Statements
Algorithms for the minmax regret path problem with interval data (English)
0 references
9 September 2020
0 references
minmax regret model with interval data
0 references
simulated annealing
0 references
shortest path problem
0 references
branch and cut
0 references
neighbourhoods for path problems
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.93430996
0 references
0.9245779
0 references
0.9186069
0 references
0.9115485
0 references
0.9092607
0 references
0.9034978
0 references
0.8921126
0 references
0.88877666
0 references
