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

DOI10.1016/j.cor.2008.04.002zbMath1177.90071OpenAlexW1966767592MaRDI QIDQ959515

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

Publication date: 17 December 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10316/4051

zbMATH Keywords

disjoint pathsOR in telecommunicationsdual arc costspaths with minimal cost sum

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (6)

Redundancy system design for an aircraft door management system ⋮ Sufficient conditions for graphs to be spanning connected ⋮ Super spanning connectivity on WK-recursive networks ⋮ One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes ⋮ THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS ⋮ An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs

Cites Work

• An effective algorithm for obtaining the whole set of minimal cost pairs 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
• Unnamed Item
• Unnamed Item

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