A polynomial algorithm for minimizing discrete convic functions in fixed dimension.
Sergey I. VeselovDmitriy V. GribanovNikolai Yu. ZolotykhAleksandr Yu. ChirkovPublished in: CoRR (2020)
Keyphrases
- optimal solution
- optimization algorithm
- preprocessing
- search space
- improved algorithm
- significant improvement
- times faster
- experimental evaluation
- computational cost
- polynomially bounded
- objective function
- recognition algorithm
- particle swarm optimization
- high accuracy
- worst case
- cost function
- probabilistic model
- expectation maximization
- theoretical analysis
- dynamic programming
- ant colony optimization
- multi objective
- k means
- data structure