Biblioteca Digital do Instituto Politécnico de Bragança   Instituto Politécnico de Bragança

Biblioteca Digital do IPB >
Escola Superior de Tecnologia e Gestão >
Informática e Comunicações >
IC - Artigos em Revistas Indexados ao ISI/Scopus >

Please use this identifier to cite or link to this item:

Título: An effective algorithm for obtaining the whole set of minimal cost pairs 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
Issue Date: 2010
Editora: Springer
Citação: Gomes, Teresa; Craveirinha, José; Jorge, Luísa (2010) - An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs. Journal of Combinatorial Optimization. ISSN 1382-6905. p.394-414
Relatório da Série N.º: 19/3;
Resumo: In telecommunication networks design the problem of obtaining optimal (arc or node) disjoint paths, for increasing network reliability, is extremely important. The problem of calculating kc disjoint paths from s to t (two distinct nodes), in a network with kc different (arbitrary) costs on every arc such that the total cost of the paths is minimised, is NP-complete even for kc = 2. When kc = 2 these networks are usually designated as dual arc cost networks. In this paper we propose an exact algorithm for finding the whole set of arc-disjoint path pairs, with minimal cost in a network with dual arc costs. The correctness of the algorithm is based on a condition which guarantees that the optimal path pair cost has been obtained and on a proposition which guarantees that at the end of the algorithm all the optimal pairs have been obtained. The optimality condition is based on the calculation of upper and lower bounds on the optimal cost. Extensive experimentation is presented to show the effectiveness of the algorithm.
Arbitragem científica: yes
ISSN: 1382-6905
Appears in Collections:IC - Artigos em Revistas Indexados ao ISI/Scopus

Files in This Item:

File Description SizeFormat
CO10-gomes2008minimalcostpairallset.pdf905,66 kBAdobe PDFView/Open
Restrict Access. You can request a copy!
CO10-gomes2008minimalcostpairallset - resumo.pdf115,64 kBAdobe PDFView/Open

Please give feedback about this item
FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Logotipo do DeGóis 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


© Instituto Politécnico de Bragança - Biblioteca Digital - Feedback - Statistics
Promotores do RCAAP   Financiadores do RCAAP

Fundação para a Ciência e a Tecnologia Universidade do Minho   Governo Português Ministério da Educação e Ciência PO Sociedade do Conhecimento (POSC) Portal oficial da União Europeia