Utilize este identificador para referenciar este registo:
https://hdl.handle.net/10316/4051
Título: | An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs | Autor: | Gomes, Teresa Craveirinha, José Jorge, Luísa |
Palavras-chave: | OR in telecommunications; Paths with minimal cost sum; Dual arc costs; Disjoint paths | Data: | 1-Set-2008 | Citação: | Computers & Operations Research. In Press, Corrected Proof: | Resumo: | Routing optimisation in some types of networks requires the calculation of the minimal cost pair of disjoint paths such that the cost functions associated with the arcs in the two paths are different. An exact algorithm for solving this NP-complete problem is proposed, based on a condition which guarantees that the optimal path pair cost has been obtained. This optimality condition is based on the calculation of upper and lower bounds on the optimal cost. A formal proof of the correctness of the algorithm is described. Extensive experimentation is presented to show the effectiveness of the algorithm, including a comparison with an integer linear programming formulation. | URI: | https://hdl.handle.net/10316/4051 | DOI: | 10.1016/j.cor.2008.04.002 | Direitos: | openAccess |
Aparece nas coleções: | FCTUC Eng.Electrotécnica - Artigos em Revistas Internacionais |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
file90d0a5dc91c04f74aac54dfa63755dbb.pdf | 641.97 kB | Adobe PDF | Ver/Abrir |
Citações SCOPUSTM
20
Visto em 29/jul/2024
Citações WEB OF SCIENCETM
16
Visto em 2/ago/2024
Visualizações de página 20
704
Visto em 6/ago/2024
Downloads
290
Visto em 6/ago/2024
Google ScholarTM
Verificar
Altmetric
Altmetric
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.