An optimal algorithm for rectangle placement.
Patrick HealyMarcus CreavinAgo KuusikPublished in: Oper. Res. Lett. (1999)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- globally optimal
- significant improvement
- optimization algorithm
- improved algorithm
- computational complexity
- preprocessing
- search space
- detection algorithm
- clustering method
- np hard
- expectation maximization
- k means
- times faster
- learning algorithm
- input data
- simulated annealing
- ant colony optimization
- weighting coefficients
- neural network
- high accuracy
- decision trees
- cost function
- objective function
- matching algorithm
- locally optimal
- genetic algorithm
- estimation error
- knapsack problem
- closed form
- path planning
- linear programming
- tree structure
- computational cost
- probabilistic model
- motion estimation
- segmentation algorithm
- data sets