Exact methods based on node-routing formulations for undirected arc-routing problems.
Roberto BaldacciVittorio ManiezzoPublished in: Networks (2006)
Keyphrases
- directed graph
- exact methods
- undirected graph
- routing algorithm
- np hard
- integer programming
- network nodes
- intermediate nodes
- shortest path
- optimal solution
- exact algorithms
- weighted graph
- routing protocol
- branch and bound algorithm
- search methods
- link failure
- lower bound
- exact solution
- mobile ad hoc networks
- machine learning