Efficient heuristics for determining node-disjoint path pairs visiting specified nodes

DOI10.1002/NET.21778MaRDI QIDQ6496358

David Tipper, Teresa Gomes, Lúcia Martins

Publication date: 3 May 2024

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

heuristicsmin-sumnode-disjoint path pairpath-based formulationresilient routingvisiting a given set of nodes

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• A note on two problems in connexion with graphs
• New formulations for the elementary shortest-path problem visiting a given set of nodes
• Resilience and survivability in communication networks: strategies, principles, and survey of disciplines
• A quick method for finding shortest pairs of disjoint paths
• The Routing Problem with “K” Specified Nodes
• An Appraisal of Some Shortest-Path Algorithms
• Finding the K Shortest Loopless Paths in a Network
• Some constrained shortest-route problems
• Algorithms for Obtaining Shortest Paths Visiting Specified Nodes

This page was built for publication: Efficient heuristics for determining node-disjoint path pairs visiting specified nodes