An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem.
Jianping LiLijian CaiJunran LichenPengxiang PanWencheng WangSuding LiuPublished in: AAIM (2021)
Keyphrases
- learning algorithm
- search space
- k means
- matching algorithm
- dynamic programming
- preprocessing
- experimental evaluation
- high accuracy
- times faster
- detection algorithm
- optimization algorithm
- gradient projection
- combinatorial optimization
- computationally efficient
- expectation maximization
- worst case
- np hard
- cost function
- computational complexity
- neural network
- simulated annealing
- approximation ratio
- min max
- improved algorithm
- convergence rate
- convex hull
- clustering algorithm
- optimal solution
- monte carlo
- constraint satisfaction problems
- computational cost
- particle swarm optimization