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

DOI10.1007/s10878-009-9255-4zbMath1188.90059OpenAlexW2011785028MaRDI QIDQ975758

Teresa Gomes, Luísa Jorge, José F. Craveirinha

Publication date: 11 June 2010

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9255-4

zbMATH Keywords

OR in telecommunicationspaths with minimal cost sum

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (1)

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

Cites Work

• Unnamed Item
• An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
• A new implementation of Yen's ranking loopless paths algorithm
• A quick method for finding shortest pairs of disjoint paths
• Finding disjoint paths with different path-costs: Complexity and algorithms
• Disjoint paths in a network
• DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs