Algorithms for the minmax regret path problem with interval data (Q2198244)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the minmax regret path problem with interval data |
scientific article |
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
