A simple and fast algorithm for convex decomposition in relax-and-round mechanisms.
Martin BichlerSalman FadaeiDennis KraftPublished in: Comput. Oper. Res. (2019)
Keyphrases
- detection algorithm
- dynamic programming
- shape decomposition
- objective function
- optimal solution
- preprocessing
- learning algorithm
- globally optimal
- computationally efficient
- high accuracy
- computational cost
- k means
- np hard
- significant improvement
- times faster
- optimization algorithm
- particle swarm optimization
- theoretical analysis
- segmentation algorithm
- decomposition algorithm
- convex hull
- multiscale
- computational complexity
- input data
- search space
- classification algorithm
- matching algorithm
- worst case
- scheduling problem
- improved algorithm
- similarity measure
- experimental evaluation
- neural network