Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
The minmax regret robust shortest path problem aims at finding a path that minimizes the maximum deviation from the shortest paths over all scenarios. It is assumed that different arc costs are associated with different scenarios. This paper introduces a technique to reduce the network, before a min...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2016
|
| Online Access: | http://hdl.handle.net/10316/44390 |
| Country: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/44390 |