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...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2016
|
| Texto completo: | http://hdl.handle.net/10316/44390 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/44390 |