A Branch-and-Cut Algorithm for the Median-Path Problem.
Pasquale AvellaMaurizio BocciaAntonio SforzaIgor Vasil'evPublished in: Comput. Optim. Appl. (2005)
Keyphrases
- detection algorithm
- computational cost
- dynamic programming
- preprocessing
- k means
- learning algorithm
- computationally efficient
- experimental evaluation
- np hard
- cost function
- optimization algorithm
- times faster
- convex hull
- tree structure
- estimation algorithm
- high accuracy
- particle swarm optimization
- simulated annealing
- worst case
- optimal solution
- significant improvement
- search space
- shortest path problem
- data sets
- bayesian networks
- recognition algorithm
- objective function
- path planning
- matching algorithm
- video sequences
- segmentation algorithm
- probabilistic model
- expectation maximization
- input data
- linear programming