An exact dynamic programming algorithm, lower and upper bounds, applied to the large block sale problem.
David NizardNicolas DupinDominique QuadriPublished in: CoDIT (2022)
Keyphrases
- dynamic programming
- lower and upper bounds
- objective function
- learning algorithm
- lagrangian relaxation
- lower bound
- optimal solution
- worst case
- greedy algorithm
- search space
- upper bound
- np hard
- expectation maximization
- detection algorithm
- upper and lower bounds
- computational complexity
- state space
- simulated annealing
- segmentation algorithm
- convex hull
- special case
- convergence rate
- exact and approximate