Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/4051
Title: An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
Authors: Gomes, Teresa 
Craveirinha, José 
Jorge, Luí­sa 
Keywords: OR in telecommunications; Paths with minimal cost sum; Dual arc costs; Disjoint paths
Issue Date: 1-Sep-2008
Keywords: OR in telecommunications; Paths with minimal cost sum; Dual arc costs; Disjoint paths
Issue Date: 1-Sep-2008
Citation: Computers & Operations Research. In Press, Corrected Proof:
Abstract: 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: http://hdl.handle.net/10316/4051
Rights: openAccess
Appears in Collections:FCTUC Eng.Electrotécnica - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
file90d0a5dc91c04f74aac54dfa63755dbb.pdf641.97 kBAdobe PDFView/Open
Show full item record

Page view(s) 20

478
checked on Aug 20, 2019

Download(s)

28
checked on Aug 20, 2019

Google ScholarTM

Check


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