An exact dynamic programming algorithm, lower and upper bounds, applied to the large block sale problem.
David NizardNicolas DupinDominique QuadriPublished in: CoRR (2021)
Keyphrases
- dynamic programming
- lower and upper bounds
- np hard
- computational complexity
- lower bound
- detection algorithm
- optimal solution
- k means
- upper bound
- simulated annealing
- expectation maximization
- exact and approximate
- lagrangian relaxation
- block matching
- upper and lower bounds
- knapsack problem
- segmentation algorithm
- state space
- probabilistic model
- ant colony optimization
- convergence rate
- energy function
- learning algorithm
- special case
- max flow