A new algorithm for the directed chinese postman problem.
Yaxiong LinYongchang ZhaoPublished in: Comput. Oper. Res. (1988)
Keyphrases
- times faster
- learning algorithm
- preprocessing
- experimental evaluation
- recognition algorithm
- computational complexity
- k means
- detection algorithm
- theoretical analysis
- min max
- estimation algorithm
- optimization algorithm
- computationally efficient
- probabilistic model
- computational cost
- np hard
- significant improvement
- optimal solution
- worst case
- segmentation algorithm
- mathematical model
- matching algorithm
- convex hull
- memory requirements
- search space
- single pass