Utilize este identificador para referenciar este registo: http://hdl.handle.net/10198/4995
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: 2009
Editora: Elsevier
Citação: Gomes, Teresa; Craveirinha, José; Jorge, Luísa (2009) - An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs. Computers & Operations Research. ISSN 0305-0548. 36:5, p.1670-1682
Relatório da Série N.º: 5;
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.
Peer review: yes
URI: http://hdl.handle.net/10198/4995
ISSN: 0305-0548
Aparece nas colecções:IC - Artigos em Revistas Indexados ao ISI/Scopus

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
COR09-gomes2008minimalcostpair.pdf631,99 kBAdobe PDFVer/Abrir    Acesso Restrito. Solicitar cópia ao autor!
COR09-gomes2008minimalcostpair - resumo.pdf99,75 kBAdobe PDFVer/Abrir


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.