Please use this identifier to cite or link to this item:
https://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 | 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: | https://hdl.handle.net/10316/4051 | DOI: | 10.1016/j.cor.2008.04.002 | Rights: | openAccess |
Appears in Collections: | FCTUC Eng.Electrotécnica - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
file90d0a5dc91c04f74aac54dfa63755dbb.pdf | 641.97 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
20
checked on Oct 7, 2024
WEB OF SCIENCETM
Citations
17
checked on Oct 2, 2024
Page view(s) 20
712
checked on Oct 8, 2024
Download(s)
300
checked on Oct 8, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.