A branch-and-cut algorithm for the maximum benefit Chinese postman problem.
Angel CorberánIsaac PlanaAntonio M. Rodríguez-ChíaJosé M. SanchisPublished in: Math. Program. (2013)
Keyphrases
- optimization algorithm
- times faster
- experimental evaluation
- detection algorithm
- learning algorithm
- high accuracy
- data sets
- computational complexity
- cost function
- computationally efficient
- dynamic programming
- preprocessing
- objective function
- clustering method
- matching algorithm
- theoretical analysis
- single pass
- worst case
- np hard
- significant improvement
- k means
- optimal solution
- least squares
- probabilistic model
- computational cost
- experimental study
- tree structure
- convex hull
- convergence rate
- selection algorithm
- min max