Efficient heuristics for determining node-disjoint path pairs visiting specified nodes
Sign Up to like & getrecommendations! Published in 2017 at "Networks"
DOI: 10.1002/net.21778
Abstract: A new recursive heuristic is proposed to calculate a shortest simple path, from a source node to a destination node, that visits a specified set of nodes in a network. To provide survivability to failures… read more here.
Keywords: node disjoint; heuristics determining; disjoint path; efficient heuristics ... See more keywords