The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm.
Marco ColombiÁngel CorberánRenata MansiniIsaac PlanaJosé M. SanchisPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- optimal solution
- computational complexity
- recognition algorithm
- detection algorithm
- convex hull
- computationally efficient
- k means
- dynamic programming
- particle swarm optimization
- high accuracy
- theoretical analysis
- significant improvement
- convergence rate
- matching algorithm
- times faster
- hierarchical clustering
- experimental evaluation
- np hard
- objective function
- benchmark problems
- bi level
- selection algorithm
- improved algorithm
- convex sets
- neural network
- classification algorithm
- motion estimation
- computational cost
- multiresolution
- search space
- data structure
- learning algorithm