# An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs

@article{Gomes2009AnEA, title={An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs}, author={Teresa Gomes and Jos{\'e} M. F. Craveirinha and Lu{\'i}sa Jorge}, journal={Computers & OR}, year={2009}, volume={36}, pages={1670-1682} }

- Published 2009 in Computers & OR
DOI:10.1016/j.cor.2008.04.002

Keywords: OR in telecommunications Paths with minimal cost sum Dual arc costs Disjoint paths 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… CONTINUE READING

Highly Cited

This paper has 17 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

11 Citations

18 References

Similar Papers