The minmax regret robust shortest path problem in a finite multi-scenario model
The robust shortest path problem is a network optimization problem that can be defined to deal with uncertainty of costs associated with the arcs of a network. Two models have been considered for the robust shortest path problem: interval data and discrete data sets. This work addresses the robust s...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2014
|
| Texto completo: | http://hdl.handle.net/10316/44387 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/44387 |