Shortest path problems with partial information: Models and algorithms for detecting dominance
In this work we focus on partial information models for the well-known shortest path problem, where we consider multiple instances of values for the parameters that determine the cost of each arc. This allows coping with the uncertainty about the future, the imprecision of data, the arbitrariness of...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2000
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10316/5506 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/5506 |