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

Computers and Operations Research

Volumn 36, Issue 5, 2009, Pages 1670-1682

  Gomes, Teresa ^a,b   Craveirinha, José ^a,b   Jorge, Luísa ^b,c  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b INESC COIMBRA   (Portugal)

^c INSTITUTO POLITÉCNICO DE BRAGANÇA   (Portugal)

Author keywords

Disjoint paths; Dual arc costs; OR in telecommunications; Paths with minimal cost sum

Indexed keywords

CAVITY RESONATORS; COMPUTER NETWORKS; CONTROL THEORY; COST FUNCTIONS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; NUCLEAR PROPULSION;

ARC COSTS; COMPLETE PROBLEMS; DISJOINT PATHS; DUAL ARC COSTS; EFFECTIVE ALGORITHMS; EXACT ALGORITHMS; FORMAL PROOFS; INTEGER LINEAR PROGRAMMING FORMULATIONS; MINIMAL COSTS; OPTIMAL COSTS; OPTIMAL PATHS; OPTIMALITY CONDITIONS; OPTIMISATION; OR IN TELECOMMUNICATIONS; PATHS WITH MINIMAL COST SUM; UPPER AND LOWER BOUNDS;

COSTS;

EID: 55749105565     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.04.002     Document Type: Article

References (17)

1. Suurballe J.W. Disjoint paths in networks. Networks 4 (1974) 125-145
2. Suurballe J.W., and Tarjan R.E. A quick method for finding shortest pairs of disjoint paths. Networks 14 2 (1984) 325-336
3. Xu D., Chen Y., Xiong Y., Qiao C., and He X. On finding disjoint paths in single and dual link cost networks. IEEE INFOCOM 2004 (2004), IEEE, New York
4. Laborczi P., Tapolcai J., Ho P.-H., Cinkler T., Recski A., and Mouftah H.T. Algorithms for asymmetrically weighted pair of disjoint paths in survivable networks. In: Cinkler T. (Ed). Proceedings of design of reliable communication networks (DRCN 2001) (October 7-10 2001) 220-227
5. Li C.-L., McCormick S.T., and Simchi-Levi D. Finding disjoint paths with different path costs: complexity and algorithms. Networks 22 (1992) 653-667
6. Kodialam M., and Lakshman T.V. Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information. IEEE/ACM Transactions on Networking 11 3 (2003) 399-410
7. Ho P.-H., Tapolcai J., and Mouftah H.T. On achieving optimal survivable routing for shared protection in survivable next-generation internet. IEEE Transactions on Reliability 53 2 (2004) 216-225
8. Mouftah H.T., and Ho P.-H. Optical networks-architecture and survivability (2003), Kluwer Academic Publishers, Dordrecht
9. Bang-Jensen J., and Gutin G. Digraphs: theory, algorithms and applications, Springer monographs in mathematics (2002), Springer, Berlin
10. Laborczi P., Tapolcai J., and Cinkler T. Efficient algorithms for physically-disjoint routing in survivable networks. Networks 2004 (June 13-16, 2004) 185-191
11. Martins E, Pascoal M, Santos J. An algorithm for ranking loopless paths. Technical Report 99/007, CISUC, 1999 〈http://www.mat.uc.pt/∼marta/Publicacoes/mps2.ps〉.
12. Martins E., Pascoal M., and Santos J. Deviation algorithms for ranking shortest paths. International Journal of Foundations of Computer Science 10 3 (1999) 247-263
13. Yen J.Y. Finding the k shortest loopless paths in a network. Management Science 17 11 (1971) 712-716
14. Martins E., and Pascoal M. A new implementation of Yen's ranking loopless paths algorithm. 4OR-Quarterly Journal of the Belgian, French and Italian Operations Research Societies 1 2 (2003) 121-134
15. Gomes T., Martins L., and Craveirinha J. An algorithm for calculating the k shortest paths with a maximum number of arcs. Investigação Operacional 21 2 (2001) 235-244
16. Ford Jr. L.R., and Fulkerson D.R. Network flows (1962), Princeton University Press, Princeton, NJ
17. Gomes T, Craveirinha J, Jorge L. An effective algorithm for obtaining minimal cost pairs of disjoint paths with dual arc costs. Technical Report 5, INESC-Coimbra, Coimbra, Portugal; 2006. ISSN: 1645-2631.