An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
The paper addresses the lexicographically maximal risk-disjoint/minimal cost path pair problem that aims at finding a pair of paths between two given nodes, which is the shortest (in terms of cost) among those that have the fewest risks in common. This problem is of particular importance in telecomm...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2021
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10316/97138 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/97138 |