An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs

T. Gomes (), J. Craveirinha and L. Jorge
Additional contact information
T. Gomes: University of Coimbra
J. Craveirinha: University of Coimbra
L. Jorge: Polytechnic Institute of Bragança

Journal of Combinatorial Optimization, 2010, vol. 19, issue 3, No 8, 394-414

Abstract: Abstract In telecommunication networks design the problem of obtaining optimal (arc or node) disjoint paths, for increasing network reliability, is extremely important. The problem of calculating k c disjoint paths from s to t (two distinct nodes), in a network with k c different (arbitrary) costs on every arc such that the total cost of the paths is minimised, is NP-complete even for k c =2. When k c =2 these networks are usually designated as dual arc cost networks. In this paper we propose an exact algorithm for finding the whole set of arc-disjoint path pairs, with minimal cost in a network with dual arc costs. The correctness of the algorithm is based on a condition which guarantees that the optimal path pair cost has been obtained and on a proposition which guarantees that at the end of the algorithm all the optimal pairs have been obtained. The optimality condition is based on the calculation of upper and lower bounds on the optimal cost. Extensive experimentation is presented to show the effectiveness of the algorithm.

Keywords: OR in telecommunications; Paths with minimal cost sum; Dual arc costs (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9255-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:19:y:2010:i:3:d:10.1007_s10878-009-9255-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-009-9255-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().