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

DOI10.1002/NET.21778MaRDI QIDQ6496358zbMATH OpenFDO

Authors Lúcia Martins, Teresa Gomes, David Tipper

Publication date 3 May 2024

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NET.21778

zbMATH Keywords

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

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Computing disjoint paths with length constraints
• A heuristic algorithm for multi-constrained shortest link-disjoint paths
• On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
• Finding disjoint paths with related path costs
• Toward fast calculation of communication paths for resilient routing

Cites work

• A note on two problems in connexion with graphs
• A quick method for finding shortest pairs of disjoint paths
• Algorithms for Obtaining Shortest Paths Visiting Specified Nodes
• An Appraisal of Some Shortest-Path Algorithms
• Finding the K Shortest Loopless Paths in a Network
• 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
• Some constrained shortest-route problems
• The Routing Problem with “K” Specified Nodes

Cited in

(2)

• A branch-and-cut algorithm for the multiple Steiner TSP with order constraints
• Revisiting directed disjoint paths on tournaments (and relatives)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496358)