A branch-and-price algorithm for the Minimum Latency Problem.
Teobaldo BulhõesRuslan SadykovEduardo UchoaPublished in: Comput. Oper. Res. (2018)
Keyphrases
- objective function
- improved algorithm
- k means
- detection algorithm
- probabilistic model
- computational cost
- experimental evaluation
- times faster
- theoretical analysis
- dynamic programming
- matching algorithm
- cost function
- estimation algorithm
- learning algorithm
- convergence rate
- square error
- simulated annealing
- computationally efficient
- np hard
- significant improvement
- computational complexity
- optimal solution
- data sets
- optimization algorithm
- high accuracy
- energy function
- tree structure
- path planning
- preprocessing
- global minimum
- single pass
- constant factor
- neural network