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}
}
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
11 Citations
18 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 11 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Efficient algorithms for physically-disjoint routing in survivable networks

  • P Laborczi, J Tapolcai, T. Cinkler
  • June 13--16,
  • 2004
Highly Influential
8 Excerpts

An algorithm for ranking loopless paths

  • E Martins, M Pascoal, J. Santos
  • Technical Report 99/007,
  • 1999
Highly Influential
4 Excerpts

Optical networks---architecture and survivability

  • HT Mouftah, Ho P-H
  • Dordrecht: Kluwer Academic Publishers;
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…