A lower bound for the Node, Edge, and Arc Routing Problem.
Lukas BachGeir HasleSanne WøhlkPublished in: Comput. Oper. Res. (2013)
Keyphrases
- lower bound
- upper bound
- disjoint paths
- branch and bound algorithm
- edge detection
- objective function
- undirected graph
- edge information
- branch and bound
- worst case
- np hard
- optimal solution
- lower bounding
- weighted graph
- lower and upper bounds
- edge detector
- directed graph
- approximation algorithms
- tree structure
- upper and lower bounds
- linear programming relaxation
- graph structure
- multiple scales
- dynamic time warping
- wireless networks
- linear programming
- special case
- polynomial approximation
- active learning