A branch-and-cut algorithm for the ring spur assignment problem.
Paula CarrollBernard FortzMartine LabbéSeán McGarraghyPublished in: Networks (2013)
Keyphrases
- np hard
- preprocessing
- times faster
- learning algorithm
- segmentation algorithm
- computational complexity
- optimal solution
- simulated annealing
- k means
- significant improvement
- experimental evaluation
- computational cost
- high accuracy
- selection algorithm
- single pass
- recognition algorithm
- detection algorithm
- linear programming
- theoretical analysis
- particle swarm optimization
- expectation maximization
- experimental study
- tree structure
- classification algorithm
- path planning
- data structure
- bayesian networks
- improved algorithm
- image segmentation